Let $A = \{a, b, c\}$ and the relation $R$ be defined on $A$ as follows $R = \{(a, a), (b, c), (a, b)\}$. Then, write minimum number of ordered pairs to be added in $R$ to make $R$ reflexive and transitive.
Answer & explanation
Correct answer: option 2
The correct answer is Option (2) → 3 ##
Given relation, $R = \{(a, a), (b, c), (a, b)\}$.
To make $R$ is reflexive we must add $(b, b)$ and $(c, c)$ to $R$.
Also, to make $R$ is transitive we must add $(a, c)$ to $R$. So, minimum number of ordered pair is to be added are $(b, b), (c, c), (a, c)$.