Option (B) is correct.
Explanation: Write both new relations out in full first, then test the three properties on each.
The intersection. A pair is in R1∩R2 only if it is in both lists:
R1∩R2={(1,1),(2,2),(3,3)}
This is the identity relation on A. It is reflexive (all three pairs (a,a) are there), symmetric (the mirror of (a,a) is (a,a) itself) and transitive (the only chain is (a,a) with (a,a), giving (a,a)). So it is an equivalence relation.
That was no accident. For any two equivalence relations R1,R2 on a set A:
- (a,a)∈R1 and (a,a)∈R2 for every a, so (a,a)∈R1∩R2 — reflexive.
- (a,b)∈R1∩R2 means (a,b) lies in both, so (b,a) lies in both — symmetric.
- (a,b) and (b,c) in R1∩R2 put (a,c) in R1 and in R2, so in R1∩R2 — transitive.
The intersection of two equivalence relations is always an equivalence relation.
The union. Now collect every pair appearing in either list:
R1∪R2={(1,1),(2,2),(3,3),(1,2),(2,1),(2,3),(3,2)}
It is reflexive — all three (a,a) are present. It is symmetric — (1,2) has (2,1), and (2,3) has (3,2). But transitivity fails: (1,2)∈R1∪R2 and (2,3)∈R1∪R2, so transitivity demands (1,3), and (1,3) is in neither list. Item 1 is interchangeable with 2 according to Inspector I, and 2 with 3 according to Inspector II, but no single inspector ever linked 1 with 3. That is exactly why unions break: a chain can be assembled out of links belonging to different relations.

Why the other options tempt:
| Option | The mistake |
|---|
| (A) | Only reflexivity and symmetry were checked on the union. Both survive a union; transitivity is the one that does not. |
| (C) | The intersection is small, but "small" is not the same as "not reflexive". It contains (1,1), (2,2) and (3,3), which is all reflexivity asks for. The identity relation is the smallest equivalence relation on A, not a failed one. |
| (D) | (2,1) is in the union — it comes from R1. The pair that is genuinely absent is (1,3), and its mirror (3,1). |