Option (D) is correct.
Explanation: Add only what one of the three properties forces, then look again, because a newly added pair can force more.
Step 1 — reflexive. (1,1),(2,2),(3,3),(4,4) are all already there. Nothing to add.
Step 2 — symmetric. R holds (1,3), so it must hold (3,1). It holds (3,4), so it must hold (4,3). That is 2 pairs added.
Step 3 — transitive. Now look at the chains. (1,3) and (3,4) are both in R, so (1,4) must be added. That is a third pair.
Step 4 — symmetric again. The new pair (1,4) needs its mirror (4,1). That is a fourth pair.
Step 5 — check nothing more is forced. The relation now contains every one of the 9 ordered pairs built from {1,3,4}, together with (2,2). Its classes are {1,3,4} and {2}, and a relation whose classes partition the set like that is an equivalence relation. So we stop.
10 pairs in the end−6 pairs at the start=4 pairs added

Why the other options are tempting:
- (A) 1 — only (3,1) was added, repairing one symmetry gap and stopping.
- (B) 2 — symmetry was repaired fully, but the chain (1,3),(3,4) was never tested, so (1,4) was missed.
- (C) 3 — (3,1),(4,3),(1,4) were added, forgetting that (1,4) is itself a new pair that needs its own mirror (4,1).