Let $X = R \times R$. Define a relation R on X as: $(a_1, b_1) R (a_2, b_2) \Leftrightarrow b_1 = b_2$ Statement I: $R$ is an equivalence relation. Statement II: For some $(a, b) \in X$, the set $S = \{(x, y) \in X : (x, y)R(a, b)\}$ represents a line parallel to $y = x$. In the light of the above statements, choose the correct answer from the options given below:

Let the relations $R_1$ and $R_2$ on the set $X = \{1, 2, 3, ..., 20\}$ be given by $R_1 = \{(x, y) : 2x - 3y = 2\}$ and $R_2 = \{(x, y) : -5x + 4y = 0\}$. If $M$ and $N$ be the minimum number of elements required to be added in $R_1$ and $R_2$, respectively, in order to make the relations symmetric, then $M + N$ equals

Let $P(S)$ denote the power set of $S=${$1, 2, 3, …, 10$}. Define the relations $R_1$ and $R_2$ on $P(S)$ as $AR_1B$ if $(A \cap B^c) \cup (B \cap A^c) = \emptyset$ and $AR_2B$ if $A \cup B^c = B \cup A^c$, $\forall A, B \in P(S)$. Then :

Let $A = {1, 2, 3, ..., 100}$ and $R$ be a relation on $A$ such that $R = {(a, b) : a = 2b + 1}$. Let $(a_1, a_2), (a_2, a_3), (a_3, a_4), ..., (a_k, a_{k+1})$ be a sequence of $k$ elements of $R$ such that the second entry of an ordered pair is equal to the first entry of the next ordered pair. Then the largest integer k , for which such a sequence exists, is equal to :

Let X = {n $ \in $ N : 1 $ \le $ n $ \le $ 50}. If A = {n $ \in $ X: n is a multiple of 2} and B = {n $ \in $ X: n is a multiple of 7}, then the number of elements in the smallest subset of X containing both A and B is ________.