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 $S=\left\{p_1, p_2 \ldots, p_{10}\right\}$ be the set of first ten prime numbers. Let $A=S \cup P$, where $P$ is the set of all possible products of distinct elements of $S$. Then the number of all ordered pairs $(x, y), x \in S$, $y \in A$, such that $x$ divides $y$, is ________ .
NUMERICAL
The minimum number of elements that must be added to the relation R = {(a, b), (b, c), (b, d)} on the set {a, b, c, d} so that it is an equivalence relation, is __________.