If $R$ is a relation from a set $A$ to a set $B$ and $S$ is a relation from $B$ to a set $C$, then the relation $SoR$

Given the relation $R = \{(1, 2), (2, 3)\}$ on the set $A = {1, 2, 3}$, the minimum number of ordered pairs which when added to $R$ make it an equivalence relation is

If $\mathrm{R}$ is the smallest equivalence relation on the set $\{1,2,3,4\}$ such that $\{(1,2),(1,3)\} \subset R$, then the number of elements in $\mathrm{R}$ is

Let $R$ be a relation on the set $N$ of natural numbers defined by $nRm $$\Leftrightarrow$ $n$ is a factor of $m$ (i.e.,$ n|m$). Then $R$ is

Let $R$ be the relation in the set $N$ given by $R =\{(a,\, b)\,:\, a=b-2,\, b>6\} .$ Choose the correct answer.

Let $A=\{1,3,4,6,9\}$ and $B=\{2,4,5,8,10\}$. Let $R$ be a relation defined on $A \times B$ such that $R =$ $\left\{\left(\left(a_1, b_1\right),\left(a_2, b_2\right)\right): a_1 \leq b_2\right.$ and $\left.b_1 \leq a_2\right\}$. Then the number of elements in the set $R$ is