Answer: (C) Assertion is correct, reason is incorrect.
Explanation:
Step 1: remove the modulus. Split at x=0.
- For x≥0, ∣x∣=x, so f(x)=2x+x=3x.
- For x<0, ∣x∣=−x, so f(x)=2x−x=x.
Step 2: f is one-one. Each piece is strictly increasing. The piece for x≥0 gives values 3x≥0, and the piece for x<0 gives values x<0. So a negative input and a non-negative input can never share an output, and two inputs on the same piece share an output only if they are equal. Hence f is one-one.
Step 3: f is onto. Take any y∈R.
- If y≥0, put x=3y≥0. Then f(x)=3⋅3y=y.
- If y<0, put x=y<0. Then f(x)=y.
So f is a bijection, with
f−1(y)={3y,y,y≥0y<0.
Step 4: the two values. f−1(6)=36=2; check f(2)=4+2=6. And f−1(−6)=−6; check f(−6)=−12+6=−6.
So the Assertion is correct.

The graph bends at the origin but keeps rising, so every horizontal line meets it exactly once.
Step 5: the Reason. The Reason claims that no rule with ∣x∣ can be one-one on R. One counterexample is enough to refute it, and f itself is one: its rule involves ∣x∣, yet Steps 2 and 3 show it is one-one. A modulus spoils one-one only when it folds the graph back on itself, as ∣x∣ does (∣−1∣=∣1∣). Here the 2x term is steep enough to keep both pieces rising. So the Reason is incorrect.
Assertion correct, Reason incorrect: option (C).