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?

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?

In a survey of 220 students of a higher secondary school, it was found that at least 125 and at most 130 students studied Mathematics; at least 85 and at most 95 studied Physics; at least 75 and at most 90 studied Chemistry; 30 studied both Physics and Chemistry; 50 studied both Chemistry and Mathematics; 40 studied both Mathematics and Physics and 10 studied none of these subjects. Let $m$ and $n$ respectively be the least and the most number of students who studied all the three subjects. Then $\mathrm{m}+\mathrm{n}$ is equal to ___________.

If A = {x $\in$ R : |x $-$ 2| > 1}, B = {x $\in$ R : $\sqrt {{x^2} - 3} $ > 1}, C = {x $\in$ R : |x $-$ 4| $\ge$ 2} and Z is the set of all integers, then the number of subsets of the set (A $\cap$ B $\cap$ C)c $\cap$ Z is ________________.

Let $\bigcup_{i=1}^{50} X_i = \bigcup_{i=1}^{n} Y_i = T$ where each $X_i$ contains $10$ elements and each $Y_i$ contains $5$ elements. If each element of the set $T$ is an element of exactly $20$ of sets $X_i$'s and exactly $6$ of sets $Y_i$'s, then $n$ is equal to: