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 = {-3, -2, -1, 0, 1, 2, 3}$. Let R be a relation on A defined by $xRy$ if and only if $0 \le x^2 + 2y \le 4$. Let $l$ be the number of elements in R and $m$ be the minimum number of elements required to be added in R to make it a reflexive relation. Then $l + m$ is equal to
MCQ_SINGLE
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: