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 ________
MCQ_SINGLE
Let $R = \{(1, 2), (2, 3), (3, 3)\}$ be a relation defined on the set $\{1, 2, 3, 4\}$. Then the minimum number of elements, needed to be added in $R$ so that $R$ becomes an equivalence relation, is:
NUMERICAL
Let $A=\{1,2,3, \ldots \ldots \ldots \ldots, 100\}$. Let $R$ be a relation on $\mathrm{A}$ defined by $(x, y) \in R$ if and only if $2 x=3 y$. Let $R_1$ be a symmetric relation on $A$ such that $R \subset R_1$ and the number of elements in $R_1$ is $\mathrm{n}$. Then, the minimum value of $\mathrm{n}$ is _________.
NUMERICAL
Let $A=\{1,2,3,4,5,6,7\}$. Define $B=\{T \subseteq A$ : either $1 \notin T$ or $2 \in T\}$ and $C=\{T \subseteq A: T$ the sum of all the elements of $T$ is a prime number $\}$. Then the number of elements in the set $B \cup C$ is ________________.