MCQ_SINGLE
Consider the relations $R_1$ and $R_2$ defined as $aR_1b \Leftrightarrow a^2 + b^2 = 1$ for all $a, b \in R$ and $(a, b)R_2(c, d) \Leftrightarrow a+ d = b + c$ for all $(a, b), (c, d) \in N \times N$. Then:
NUMERICAL
The minimum number of elements that must be added to the relation R = {(a, b), (b, c), (b, d)} on the set {a, b, c, d} so that it is an equivalence relation, is __________.
NUMERICAL
Let $A=\{1,2,3,4\}$ and $R=\{(1,2),(2,3),(1,4)\}$ be a relation on $\mathrm{A}$. Let $\mathrm{S}$ be the equivalence relation on $\mathrm{A}$ such that $R \subset S$ and the number of elements in $\mathrm{S}$ is $\mathrm{n}$. Then, the minimum value of $n$ is __________.