If R is the smallest equivalence relation on the set ${1, 2, 3, 4}$ such that ${((1, 2), (1, 3))} \subset R$, then the number of elements in $R$ is __________.

Let $A=\{1,2,3, \ldots \ldots \ldots \ldots, 100\}$. Let $R$ be a relation on $\mathrm{A}$ defined by $(x, y) \in R$ if and only if $2 x=3 y$. Let $R_1$ be a symmetric relation on $A$ such that $R \subset R_1$ and the number of elements in $R_1$ is $\mathrm{n}$. Then, the minimum value of $\mathrm{n}$ is _________.

The number of elements in the set $\left\{n \in \mathbb{N}: 10 \leq n \leq 100\right.$ and $3^{n}-3$ is a multiple of 7$\}$ is ___________.

Let $R$ be the set of real numbers. Statement I: $A = \{(x, y) \in R \times R: y - x \text{ is an integer }\}$ is an equivalence relation on $R$. Statement II: $B = \{(x,y) \in R \times R: x = \alpha y \text{ for some rational number } \alpha\}$ is an equivalence relation on $R$.

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?