MCQ_SINGLE
If R is the smallest equivalence relation on the set ${1, 2, 3, 4}$ such that ${((1, 2), (1, 3))} \subset R$, then the number of elements in $R$ is __________.
NUMERICAL
For $n \geq 2$, let $S_n$ denote the set of all subsets of $\{1,2, \ldots, n\}$ with no two consecutive numbers. For example $\{1,3,5\} \in S_6$, but $\{1,2,4\} \notin S_6$. Then $n\left(S_5\right)$ is equal to ________
NUMERICAL
Let $\mathrm{A}=\{1,2,3,4, \ldots ., 10\}$ and $\mathrm{B}=\{0,1,2,3,4\}$. The number of elements in the relation $R=\left\{(a, b) \in A \times A: 2(a-b)^{2}+3(a-b) \in B\right\}$ is ___________.