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 $\mathrm{A}=\{1,2,3,4,5\}$. Let $\mathrm{R}$ be a relation on $\mathrm{A}$ defined by $x R y$ if and only if $4 x \leq 5 y$. Let $m$ be the number of elements in $\mathrm{R}$ and $\mathrm{n}$ be the minimum number of elements from $\mathrm{A} \times \mathrm{A}$ that are required to be added to $\mathrm{R}$ to make it a symmetric relation. Then $m+n$ is equal to:

Among the relations $S =\left\{( a , b ): a , b \in R -\{0\}, 2+\frac{ a }{ b } > 0\right\}$ And $T =\left\{( a , b ): a , b \in R , a ^2- b ^2 \in Z \right\}$,

Let $R =\{( P , Q ) \mid P$ and $Q$ are at the same distance from the origin $\}$ be a relation, then the equivalence class of $(1,-1)$ is the set

Let L be the set of all lines in a plane and $\mathrm{R}$ be the relation in $\mathrm{L}$ defined as $\mathrm{R}=\left\{\left(\mathrm{L}_{1}, \mathrm{L}_{2}\right): \mathrm{L}_{1}\right.$ is perpendicular to $\left. \mathrm{L} _{2}\right\}$. Show that $\mathrm{R}$ is symmetric but neither reflexive nor transitive.

If $R = \{(6, 6), (9, 9), (6, 12), (12, 12), (12,6)\}$ is a relation on set $A = \{3, 6, 9, 12\}$ , then relation $R$ is