Let X = {a, b,c,d}, and R = { (a,a) (b,b) (a,c)}. Write down the minimum number of ordered pairs to be included to R to make it
(i) reflexive (ii) symmetric
(iii) transitive (iv) equivalence.

Let A = { a,b,c }, and R = {(a,a) (b,b) (a,c) }. Write down the minimum number of ordered pairs to be included to R to make it (i) reflexive (ii) symmetric (iii) transitive (iv) equivalence.

Let A={a,b,c} and R={(a,a), (b,b),(a,c)}. Write down the minimum number of ordered pairs to be included to R to make it (i) reflexive (ii) symmetric (iii) transitive (iv) equivalence

Let A={2,3,5}" and relataion "R={(2,5)} write down the minimum number of ordered pairs to be indluded to R to make it an equivalence relation.

Let set A={1,2,3} . Then find number of ordered pairs which when added to R make it reflexive but not symmetric

On the set of natural number let R be the relation defined by aRb if a+b lt=6 . Write down the relation by listing all the pairs. Check whether it is (i) reflexive (ii) symmetric (iii) transitive (iv) equivalence.

On the set of natural number let R be the relation defined by aRb if 2a +3b=30. Write down the relation by listing all the pair . check whether it is (i) reflexive (ii) symmetric (iii) transitive (iv) equivalence

Let S = (a, b, c) and R= {(a, a),(a, b), (b, b), (a, c), (c, a)}. IfR is to be equivalence relation. "Find the minimum number of ordered pairs to be included.