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 = {1, 2, 3, ..., 100}$ and $R$ be a relation on $A$ such that $R = {(a, b) : a = 2b + 1}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), ..., (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k , for which such a sequence exists, is equal to :
NUMERICAL
Let $\mathrm{A}=\{-4,-3,-2,0,1,3,4\}$ and $\mathrm{R}=\left\{(a, b) \in \mathrm{A} \times \mathrm{A}: b=|a|\right.$ or $\left.b^{2}=a+1\right\}$ be a relation on $\mathrm{A}$. Then the minimum number of elements, that must be added to the relation $\mathrm{R}$ so that it becomes reflexive and symmetric, is __________