Answer: (D) Assertion is incorrect, reason is correct.
Explanation:
Step 1 — Write the roster.
Each truck is one ordered pair, so
T={(P,Q),(Q,P),(Q,R),(R,S),(S,R)}
Step 2 — Test the Assertion, one property at a time.
Reflexive? No truck starts and ends at the same hub, so (P,P)∈/T. Not reflexive — this part of the Assertion is right.
Transitive? There is a truck P→Q and a truck Q→R, so (P,Q)∈T and (Q,R)∈T. Transitivity would demand a direct truck P→R, and there is none, so (P,R)∈/T. Not transitive — this part is right too.
Symmetric? Here the Assertion goes wrong. The truck Q→R gives (Q,R)∈T, but there is no truck from R back to Q, so (R,Q)∈/T. One such pair is enough to destroy symmetry. T is not symmetric.
An assertion is only correct if everything it claims is correct. Because the symmetry claim fails, the Assertion is incorrect.
Step 3 — Test the Reason.
(P,Q)∈T and (Q,P)∈T are both true: the trucks P→Q and Q→P both run. The Reason is correct.
The trap. Symmetry is a condition on every pair in the relation, not on one lucky pair. The pair P,Q does come with its reverse, and so does the pair R,S — but (Q,R) does not, and that single gap settles it. So the Reason is a true statement that the Assertion misused.

The diagram makes the gap visible: the P–Q link and the R–S link are two-way, while the Q→R link is one-way, and no arrow closes the path P→Q→R.