Let R1 be a relation defined by R1 = {(a, b)| a ≥ b; a, b ∈ R}. Then R1 is

For any a ∈R, we have a ≥ a, Therefore the relation R1 is reflexive but it is not symmetric as (2, 1) ∈ R1 but (1, 2) ∉ R1. The relation R1 is transitive also, because (a, b) ∈ R1, (b, c) ∈ R1 imply that a ≥ b and b ≥ c which is turn imply that a ≥ c ⇒ (a, c) ∈ R1.