Let us define a relation R in R as aRb if a ≥ b. Then, R is

The correct answer is Option (2) → reflexive, transitive but not symmetric ##

Given that, $aRb$ if $a \ge b$

$\Rightarrow aRa \Rightarrow a \ge a$ which is true.

Let $aRb, a \ge b$, then $b \ge a$ which is not true. $R$ is not symmetric.

But $aRb$ and $bRc$

$\Rightarrow a \ge b$ and $b \ge c$

$\Rightarrow a \ge c$

Hence, $R$ is transitive.