Answer:
Let [tex]f: X\rightarrow Y[/tex] be a function.
a) If f is surjective then each element of Y has a preimage in X, this means that [tex]f(X)=Y[/tex].
Since Y has less elements that X, then f can not be injective because each element of X must have a image, then by the Pigeonhole principle at least one element of Y has more that one preimage.