Let A={1, 2, 3} and R={(2, 2),(3, 3),(1, 2)} be a relation on A. Then the minimum number of ordered pairs to be added to R to make it an equivalence relation is -

Let set A=(a, b, c, d) and R= {(a, b), (b, c). (c, d)} is a relation on set A. The minimum number of ordered pairs which should be added into R to make it an equivalence relation on set A is

Let A={1,2,3} and R={(1,2),(1,1),(2,3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.

Let A={1,2,3} and R={(1,2),(1,1),(2,3)} be a relation on on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.

Let A={1,2,3} and R={(1,2),(1,1),(2,3)} be a relation on A . What minimum number of ordered pairs may be added to R so that it may become a transitive relation on Adot

Let A={1,\ 2,\ 3} and R={(1,\ 2),\ (1,\ 1),\ (2,\ 3)} be a relation on A . What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A .

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 A = {a, b, c} andR = {(a, b), (b, c)}. The minimum number of ordered pairs that must be added to R to make it an equivalence relation is

Let A={1, 2, 3} and let the relation R={(1, 2), (2, 3)} what is the minimum number of order pairs introduced to R ot make it an equivalence relation.