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 __________.
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 $A = {2, 3, 6, 8, 9, 11}$ and $B = {1, 4, 5, 10, 15}$. Let $R$ be a relation on $A \times B$ defined by $(a, b)R(c, d)$ if and only if $3ad - 7bc$ is an even integer. Then the relation $R$ is