Let be a function. Prove that (i) is injective is injective is surjective.

(ii) is surjective is surjective is injective.

So for (i) . So for . Say and . Then . for and so which implies surjectivity.

So then you go in the opposite direction to complete the proof?

Is it a similar case for (ii)?