Answer: (A) Assertion is correct, reason is correct; reason is a correct explanation for assertion.
Explanation:
Step 1 — Compute every image. Nothing can be decided before this.
The five inputs and their energies are set out below.
| x∈A | −3 | −1 | 0 | 1 | 3 |
|---|
| f(x)=x2 | 9 | 1 | 0 | 1 | 9 |
Step 2 — Many-one?
Look for two different inputs with one output. There are exactly two such collisions:
f(−1)=1=f(1),f(−3)=9=f(3)
Every value cited here is genuinely in A, so both collisions are real. Since distinct inputs can share an image, f is many-one, not one-one.
Step 3 — Onto?
The range is the set of values actually produced, {9,1,0}={0,1,9}, which is exactly the codomain. Checking element by element: 0=f(0), 1=f(1), 9=f(3). Nothing in the codomain is left unused, so f is onto.
So the Assertion is correct, and the Reason is correct: it lists precisely the two collisions, which is the many-one half, and states that the codomain is fully used, which is the onto half.
Step 4 — Is the Reason the explanation?
Yes. The Reason is not a quoted definition — it is the completed check for this particular set, and it is exactly the evidence the two conclusions need. A single collision would already prove many-one; the Reason supplies two. Full coverage of {0,1,9} is precisely what onto means.

A useful follow-up. If the domain is cut down to {0,1,3} — one representative from each collision — the same rule becomes one-one, and it is still onto {0,1,9}, so it becomes a bijection. Cutting down to {−3,−1,0} works just as well. Dropping only one of the two duplicated inputs is not enough; the other collision would survive.