The minimum number of elements that must be added to the relation $R =\{( a , b ),( b , c )\}$ on the set $\{a, b, c\}$ so that it becomes symmetric and transitive is:

A relation on the set $A\, = \,\{ x\,:\,\left| x \right|\, < \,3,\,x\, \in Z\} ,$ where $Z$ is the set of integers is defined by $R= \{(x, y) : y = \left| x \right|, x \ne  - 1\}$. Then the number of elements in the power set of $R$ is

Show that the relation $R$ in the set $\{1,2,3\}$ given by $R =\{(1,1),\,(2,2),$ $(3,3)$, $(1,2)$, $(2,3)\}$ is reflexive but neither symmetric nor transitive.

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

Let a relation $R$ on $\mathbb{N} \times \mathbb{N}$ be defined as : $\left(\mathrm{x}_1, \mathrm{y}_1\right) \mathrm{R}\left(\mathrm{x}_2, \mathrm{y}_2\right)$ if and only if $\mathrm{x}_1 \leq \mathrm{x}_2$ or $\mathrm{y}_1 \leq \mathrm{y}_2$

Consider the two statements :

($I$) $\mathrm{R}$ is reflexive but not symmetric.

($II$) $\mathrm{R}$ is transitive

Then which one of the following is true?

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$