(a) Apply the band to each score in turn.
| Student | Score | Band it falls in | Grade |
|---|
| s1 | 91 | 80 or more | A |
| s2 | 78 | 60 to 79 | B |
| s3 | 64 | 60 to 79 | B |
| s4 | 82 | 80 or more | A |
| s5 | 55 | below 60 | C |
| s6 | 70 | 60 to 79 | B |
So g={(s1,A),(s2,B),(s3,B),(s4,A),(s5,C),(s6,B)}.
(b) No, g is not one-one. Two different students receive the same grade: g(s2)=B and g(s3)=B, yet s2=s3. (The pair s1,s4 would do just as well, since both score in the A band.)
(c) Yes, g is onto G. Read off the grades that actually occur: A (from s1), B (from s2) and C (from s5). So the range of g is {A,B,C}, which is the whole of G. Nothing in the codomain is left unused, and that is exactly what onto means.
Notice that g is many-one and onto at the same time. There is no contradiction: six inputs are more than enough to cover three outputs while still colliding.

(d) g−1(B) collects every student whose score lies in the 60–79 band. From the table those are s2 (78), s3 (64) and s6 (70).
g−1(B)={s2,s3,s6},∣g−1(B)∣=3.
As a check, the three pre-image sets must account for all six students: ∣g−1(A)∣+∣g−1(B)∣+∣g−1(C)∣=2+3+1=6.
(e) It is impossible, whatever the bands are.
A one-one map must send the six students to six different grades. But there are only three grades available in G. Six different outputs cannot be found inside a set of size three, so at least two of the six students must end up sharing a grade.
Put the other way round: g is one-one only if ∣S∣≤∣G∣, and here ∣S∣=6>3=∣G∣. Redrawing the bands changes which students collide, never whether they collide.