Let $R$ be the relation in the set $\{1, 2, 3\}$ given by $R = \{(1, 1), (2, 2), (3, 3)\}$. Choose the correct answer.

Give an example of a relation which is transitive but neither reflexive nor symmetric.

The maximum number of equivalence relations on the set $A = \{1, 2, 3, 4\}$ is $N$. Then -

Let $R$ be an equivalence relation on a finite set $A$ having $n$ elements. Then the number of ordered pairs in $R$ is

Let $X = R \times R$. Define a relation $R$ on $X$ as: $(a_1, b_1) R (a_2, b_2) \Leftrightarrow b_1 = b_2$. Statement-$I$: $R$ is an equivalence relation. Statement-$II$: For some $(a, b) \in X$,the set $S = \{(x, y) \in X : (x, y) R (a, b)\}$ represents a line parallel to $y = x$. In the light of the above statements,choose the correct answer from the options given below:

For a set $A = \{1, 2, 3\}$,a relation $R = \{(1, 2), (2, 3)\}$ is defined. What is the minimum number of ordered pairs that must be added to $R$ to make it an equivalence relation?