Answer: (C) Assertion is correct, reason is incorrect.
Explanation:
Judge the two statements separately first, then ask whether the second explains the first.
Step 1 — is the Assertion true? Here X is finite and f sends X into the same set X. Write ∣X∣=n.
Suppose f is onto. Then all n elements of X appear as outputs. Those n outputs are produced by only n inputs. If two inputs shared an output, the n inputs would produce at most n−1 different outputs, and some element of X would be missed — contradicting onto. So no two inputs share an output, and f is one-one.
Suppose instead f is one-one. Then the n inputs give n different outputs. All n of these lie inside X, and X has exactly n elements, so they must be the whole of X. Hence f is onto.
The Assertion is true.
Step 2 — is the Reason true, exactly as printed? The Reason mentions no finite set and no map from a set to itself. It is a claim about every function, so a single counterexample settles it.
Let f:N→N be f(n)=2n. It is one-one, because 2n1=2n2 gives n1=n2. It is not onto: 3∈N, but 2n=3 has no solution in N. So a one-one function need not be onto.

The second half of the Reason fails too. Let g:Z→Z be g(n)=⌊n/2⌋, the greatest integer not exceeding n/2. Every integer m is an output, since g(2m)=m, so g is onto; but g(0)=0=g(1) with 0=1, so g is not one-one.
The Reason is false.
Step 3 — combine. Assertion true, Reason false. That is option (C).
Where the trap lies. The Reason turns into a true statement the moment two words are put back: finite, and from a set to itself. Those are exactly the hypotheses the Assertion carries and the Reason drops. A statement that quietly loses a hypothesis is not a "more general version" of the original — it is a different statement, and here a false one.
| Statement | Hypothesis about the set | Verdict |
|---|
| Assertion | X finite, f:X→X | True |
| Reason as printed | none | False, e.g. f(n)=2n on N |