The Answer to the Question
is below this banner.
Here's the Solution to this Question
Let us give an example of a function which represents all types of a function. Consider the function Since for we have that we conclude that this function is injection. Taking into account that we conclude that the function is surjection, and hence this function is bijection.
Let us find the composite function given that and :
(f\circ g) (0)=f(g(0))=f(5)=0,\ (f\circ g) (6)=f(g(6))=f(1)=6,\