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 = {0, 1, 2, 3, 4, 5}$. Let $R$ be a relation on $A$ defined by $(x, y) \in R$ if and only if $\max{x, y} \in {3, 4}$. Then among the statements
(S1): The number of elements in $R$ is $18$, and
(S2): The relation $R$ is symmetric but neither reflexive nor transitive
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: