If $R$ is an equivalence relation on a set $A$, then ${R^{ – 1}}$ is

Let $A =\{2,3,4\}$ and $B =\{8,9,12\}$. Then the number of elements in the relation $R=\left\{\left(\left(a_1, b_1\right),\left(a_2, b_2\right)\right) \in(A \times B, A \times B): a_1\right.$ divides $b_2$ and $a_2$ divides $\left.b_1\right\}$ is:

Consider the following two binary relations on the set $A= \{a, b, c\}$ : $R_1 = \{(c, a) (b, b) , (a, c), (c,c), (b, c), (a, a)\}$ and $R_2 = \{(a, b), (b, a), (c, c), (c,a), (a, a), (b, b), (a, c)\}.$ Then

Let $I$ be the set of positve integers. $R$ is a relation on the set $I$ given by $R =\left\{ {\left( {a,b} \right) \in I \times I\,|\,\,{{\log }_2}\left( {\frac{a}{b}} \right)} \right.$ is a non-negative integer$\}$, then $R$ is 

Determine whether each of the following relations are reflexive, symmetric and transitive:

Relation $\mathrm{R}$ in the set $\mathrm{A}=\{1,2,3,4,5,6\}$ as $\mathrm{R} =\{(\mathrm{x}, \mathrm{y}): \mathrm{y}$ is divisible by $\mathrm{x}\}$