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 :

The minimum number of elements that must be added to the relation R = {(a, b), (b, c), (b, d)} on the set {a, b, c, d} so that it is an equivalence relation, is __________.

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 $A = {2, 3, 4, 5, ....., 30}$ and '$\simeq$' be an equivalence relation on $A \times A$, defined by $(a, b) \simeq (c, d)$, if and only if $ad = bc$. Then the number of ordered pairs which satisfy this equivalence relation with ordered pair $(4, 3)$ is equal to :

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