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 __________.
MCQ_SINGLE
Let $A = \{-2, -1, 0, 1, 2, 3\}$. Let R be a relation on $A$ defined by $xRy$ if and only if $y = \max\{x, 1\}$. Let $l$ be the number of elements in R. Let $m$ and $n$ be the minimum number of elements required to be added in R to make it reflexive and symmetric relations, respectively. Then $l + m + n$ is equal to
NUMERICAL
5 Let $A=\{2,3,6,7\}$ and $B=\{4,5,6,8\}$. Let $R$ be a relation defined on $A \times B$ by $(a_1, b_1) R(a_2, b_2)$ if and only if $a_1+a_2=b_1+b_2$. Then the number of elements in $R$ is __________.