A relation $R$ in set $A = \{1, 2, 3\}$ is defined as $R = \{(1, 1), (1, 2), (2, 2), (3, 3)\}$. Which of the following ordered pairs in $R$ should be removed to make it an equivalence relation in $A$?
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → $(1, 2)$ ##
By removing $(1, 2)$, we get identity relation. We know that identity relation is always an equivalence relation.