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 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={(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 A= {1,2,3} and R={(1,2), (2,3), (3,3), }be a relation on A. Add a (i) minimum (ii) maximum number of ordered pairs to R so that enlarged relation becomes an equivalence relation on A.

Let A={1,2,3} and R={(1,1),(1,3),(3,1),(2,2),(2,1),(3,3)} ,then the relation R on A is:

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 R = {(1, 2), (2, 3)} be a relation defined on set {1, 2, 3}. The minimum number of ordered pairs required to be added in R, such that enlarged relation becomes an equivalence relation is

If R={(1,2),(2,3)} is a relation in N, list the least number of ordered pairs to be included in R so that R is an equivalence relation.