The number of relations on the set $A = \{1, 2, 3\}$ containing at most $6$ elements including $(1, 2)$,which are reflexive and transitive but not symmetric,is . . . . . . .

Let $R$ be a relation from $A = \{2, 3, 4, 5\}$ to $B = \{3, 6, 7, 10\}$ defined by $R = \{(a, b) \mid a \text{ divides } b, a \in A, b \in B\}$. Then,the number of elements in $R^{-1}$ will be:

If $R$ and $R^1$ are equivalence relations on a set $A$, then which of the following is also an equivalence relation?

Let $R = \{(a, a)\}$ be a relation on a set $A$. Then $R$ is

Let $A = \{0, 1, 2, \ldots, 9\}$. Let $R$ be a relation on $A$ defined by $(x, y) \in R$ if and only if $|x - y|$ is a multiple of $3$. Given below are two statements:
Statement $I$: $n(R) = 36$
Statement $II$: $R$ is an equivalence relation.
In the light of the above statements, choose the correct answer from the options given below:

Let $S$ be the set of all real numbers. Then the relation $R = \{(a, b) : 1 + ab > 0\}$ on $S$ is