In a school, there are three types of games to be played. Some of the students play two types of games, but none play all the three games. Which Venn diagrams can justify the above statement?

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 $A = {n \in [100, 700] \cap N : n$ is neither a multiple of 3 nor a multiple of 4}. Then the number of elements in $A$ is

Two sets A and B are as under : A = {$(a, b) ∈ R × R : |a - 5| < 1$ and $|b - 5| < 1$}; B = {$(a, b) ∈ R × R : 4(a - 6)^2 + 9(b - 5)^2 ≤ 36$}; Then

Let a relation $R$ on $N \times N$ be defined as: $(x_1, y_1) R (x_2, y_2)$ if and only if $x_1 \le x_2$ or $y_1 \le y_2$. Consider the two statements: (I) $R$ is reflexive but not symmetric. (II) $R$ is transitive Then which one of the following is true?