Option (B) is correct.
Explanation: Test each encoder against both demands. The domain matters just as much as the formula.
| Encoder | One-one? | Onto? | Witness |
|---|
| f1(x)=x2 on N | yes | no | 2∈N is not the square of any natural number |
| f2(x)=x3 on R | yes | yes | every real y is the cube of the real number y1/3 |
| f3(x)=2x+1 on Z | yes | no | 2x+1 is always odd, so 2∈Z is never reached |
| f4(x)=sinx on R | no | no | sin0=sinπ=0; and sinx=2 has no solution |
Two details worth spelling out.
f1 is one-one here only because the domain is N: for positive x1,x2, x12=x22 forces x1=x2, since the negative partner −x1 is not available. The same formula on Z would be many-one.
f2 is one-one because x↦x3 is strictly increasing on R: if x1<x2 then x13<x23, so no value repeats. It is onto because every real number has a real cube root.

So f2 is the only bijection, and f3 is one-one but not onto — option (B).
Why the other options are tempting: each of (C) and (D) contains a true remark about some function, which makes the whole option look right.
- (A) is wrong twice: f1 is not onto, and f2 is never many-one.
- (C) correctly says f4 is not one-one, but f3 misses every even integer, so f3 is not the bijection.
- (D) correctly says f1 is not onto, but f4 fails both demands, so f4 is certainly not the bijection.