Concept:A relation is symmetric if
(a,b)∈R⇒(b,a)∈R.
A relation is transitive if
(a,b),(b,c)∈R⇒(a,c)∈R.
A relation is reflexive if
(a,a)∈R for every
a∈A.
Explanation:Given
(1,2)∈R, symmetry forces
(2,1)∈R.
Using transitivity on
(1,2) and
(2,1) forces
(1,1)∈R and
(2,2)∈R.
So every valid relation must contain
(1,1),(2,2),(1,2),(2,1).
For the relation to be not reflexive,
(3,3) must be missing.
If any pair involving
3 is added, symmetry adds its reverse, and transitivity then forces
(3,3).
So no pair with
3 can be included.
Thus the only valid relation is
R={(1,1),(2,2),(1,2),(2,1)}.
Answer:The number of such relations is
1.
So the correct option is D.