Let $R_1$ be a relation defined by $R_1 =\{(a, b) | a \geq b, a, b \in R\}$ . Then $R_1$ is
An equivalence relation on $R$
Reflexive, transitive but not symmetric
Symmetric, Transitive but not reflexive
Neither transitive not reflexive but symmetric
The probability that a relation $R$ from $\{ x , y \}$ to $\{ x , y \}$ is both symmetric and transitive, is equal to
The number of symmetric relations defined on the set $\{1,2,3,4\}$ which are not reflexive is
$R$ is a relation over the set of real numbers and it is given by $nm \ge 0$. Then $R$ is
Let $A = \{ 2,\,4,\,6,\,8\} $. $A$ relation $R$ on $A$ is defined by $R = \{ (2,\,4),\,(4,\,2),\,(4,\,6),\,(6,\,4)\} $. Then $R$ is
If $R$ is a relation on the set $N$, defined by $\left\{ {\left( {x,y} \right);3x + 3y = 10} \right\}$
Statement $-1$ : $R$ is symmetric
Statement $-2$ : $R$ is reflexive
Statement $-3$ : $R$ is transitive, then thecorrect sequence of given statements is
(where $T$ means true and $F$ means false)