Consider the following two binary relations on the set $A = {a, b, c}$: $R_1 = {(c, a), (b, b), (a, c), (c, c), (b, c), (a, a)}$ and $R_2 = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}$. Then:

Let $Z$ be the set of integers. If $A = {x \in Z : 2(x + 2) (x^2 - 5x + 6) = 1}$ and $B = {x \in Z : -3 < 2x - 1 < 9}$, then the number of subsets of the set $A \times B$, is

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 __________.

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

Among the relations $S = {(a, b) : a, b \in R - {0}, 2 + \frac{a}{b} > 0}$ and $T = {(a, b) : a, b \in R, a^2 - b^2 \in Z}$,