Let A and B be two sets containing four and two elements respectively. Then, the number of subsets of the set A $\times$ B , each having atleast three elements are

Let X = {1, 2, 3, 4, 5}. The number of different ordered pairs (Y, Z) that can be formed such that Y $$ \subseteq $$ X, Z $$ \subseteq $$ X and Y $$ \cap $$ Z is empty, is :

Let $R$ be the set of real numbers.

Statement I : $A=\{(x, y) \in R \times R: y-x$ is an integer $\}$ is an equivalence relation on $R$.

Statement II : $ B=\{(x, y) \in R \times R: x=\alpha y$ for some rational number $\alpha\}$ is an equivalence relation on $R$.

Consider the following relations

$R=\{(x, y) \mid x, y$ are real numbers and $x=w y$ for some rational number $w\}$;

$S=\left\{\left(\frac{m}{n}, \frac{p}{q}\right) \mid m, n, p\right.$ and $q$ are integers such that $n, q \neq 0$ and $q m=p m\}$. Then