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
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
Let $S=\{4,6,9\}$ and $T=\{9,10,11, \ldots, 1000\}$. If $A=\left\{a_{1}+a_{2}+\ldots+a_{k}: k \in \mathbf{N}, a_{1}, a_{2}, a_{3}, \ldots, a_{k}\right.$ $\epsilon S\}$, then the sum of all the elements in the set $T-A$ is equal to __________.