Answer: (C) Assertion is correct, reason is incorrect.
Explanation:
Step 1 — Build the roster first.
Compare the four scores P=45, Q=62, R=62, S=30 and keep the ordered pairs where the first score is strictly larger:
Here are the comparisons that succeed:
| pair in T | why |
|---|
| (Q,P) | 62>45 |
| (R,P) | 62>45 |
| (P,S) | 45>30 |
| (Q,S) | 62>30 |
| (R,S) | 62>30 |
So T={(Q,P),(R,P),(P,S),(Q,S),(R,S)}, five pairs. Note that Q and R scored the same 62 runs, so neither (Q,R) nor (R,Q) is in T — equal is not "more than".
Step 2 — Test the Assertion.
Not reflexive: no batter scored more runs than himself, so (P,P)∈/T. One missing pair is enough.
Not symmetric: (Q,P)∈T since 62>45, but (P,Q)∈/T since 45>62 is false.
Transitive: the only chains available are (Q,P) with (P,S), and (R,P) with (P,S). They demand (Q,S) and (R,S), and both are in T. So transitivity holds. More generally, if a scored more than b and b scored more than c, then a scored more than c.
The Assertion is correct.
Step 3 — Test the Reason.
It is false, and this very relation is the counterexample. A strict inequality such as "more runs than" is never reflexive, because a>a is always false; yet it is always transitive. Failing to be reflexive has no bearing at all on transitivity — the two conditions talk about different things, one about single elements, the other about chains of three. The Reason is a false general claim, so it cannot support anything.

In the diagram each arrow means "scored more runs than". There is no loop at any node (not reflexive), the arrow from Q to P has no partner going back (not symmetric), and wherever two arrows meet head to tail a direct arrow already exists (transitive). Q and R have no arrow between them because their scores are equal.