Draw any three graphs (Take help from book, but DO NOT copy paste any graph from examples or exercise. Your graphs must be random and all must neither be euler nor all non-euler) (2+1+2+2)
a) Figure out Euler graph from these three graphs.
b) Write down the Euler path of these graphs.
c) If not Euler, provide the reason.
4. (a) Let R be the relation on Z × Z such that ((a,b), (c,d)) ∈ R ↔ a + d = b + c. Show that R is an equivalence relation.
(b) If R is an equivalence relation on a finite non empty set A, then the equivalence classes of R all have the same number of elements?
(c) Prove that intersection of two equivalence relations on a non empty set A is an equivalence relation.