# for the set A={1,2,3} define the relation R in set A as follows:R={(1,1) (2,2) (3,3) (1,3)}. write the ordered pairs to be added to R to make it the smallest equivalent relation.

A relation is an equivalence if and only if it is reflexive , symmetric and transitive.
R = {(1,1); (2,2); (3,3); (1,3)}
the given relation is reflexive as $aRa$ for $\forall a\in R$
the given relation is not symmetric since for the pair (1,3) (3,1) must be there