Let a. b ∈ A such that (a, b) ∈ R ∩ R’.
∴ (a. b) ∈ R and (a. b) ∈ R’.
∴ (b, a) ∈ R and (b, a) ∈ R’.    (∵ R and R’ are symmetric)
⇒ (b.a) ∈ R ∩ R’.
we have proved that (a, b) ∈ R ∩ R’ ⇒ (b, a) ∈ R ∩ R’.
∴ R fl R’ is a symmetric relation.
Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}.
Choose the correct answer.
(A) (2. 4) ∈ R (B) (3, 8) ∈ R (C) (6,8) ∈ R (D)(8,7) ∈ RÂ
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is
(A) 1 Â Â Â (B) 2 Â Â Â (C) 3 Â Â Â (D) 4