Let A={1,2,3}.
(i) Construct a relation R on A that is reflexive and symmetric but not transitive.
(ii) List all ordered pairs of your relation.
(iii) Prove, by direct verification on the set A, that the relation you have given is indeed reflexive and symmetric, and clearly show the ordered pairs that violate transitivity.