Let $\mathrm{X}=\mathbf{R} \times \mathbf{R}$. Define a relation R on X as :

$$\left(a_1, b_1\right) R\left(a_2, b_2\right) \Leftrightarrow b_1=b_2$$

Statement I: $\quad \mathrm{R}$ is an equivalence relation.

Statement II : For some $(\mathrm{a}, \mathrm{b}) \in \mathrm{X}$, the $\operatorname{set} \mathrm{S}=\{(x, y) \in \mathrm{X}:(x, y) \mathrm{R}(\mathrm{a}, \mathrm{b})\}$ represents a line parallel to $y=x$.

In the light of the above statements, choose the correct answer from the options given below :

Let $\mathrm{A}=\{(x, y) \in \mathbf{R} \times \mathbf{R}:|x+y| \geqslant 3\}$ and $\mathrm{B}=\{(x, y) \in \mathbf{R} \times \mathbf{R}:|x|+|y| \leq 3\}$. If $\mathrm{C}=\{(x, y) \in \mathrm{A} \cap \mathrm{B}: x=0$ or $y=0\}$, then $\sum_{(x, y) \in \mathrm{C}}|x+y|$ is :

Let $\mathrm{R}=\{(1,2),(2,3),(3,3)\}$ be a relation defined on the set $\{1,2,3,4\}$. Then the minimum number of elements, needed to be added in R so that R becomes an equivalence relation, is:

Let $A=\{1,2,3, \ldots, 10\}$ and $B=\left\{\frac{m}{n}: m, n \in A, m< n\right.$ and $\left.\operatorname{gcd}(m, n)=1\right\}$. Then $n(B)$ is equal to :