2. For each pair of sets A and B given in problem parts (a) (b), follow the directions given in (i)-(iv). Use proper capitalization and complete sentences when you are asked to write something. (i) Is it possible to construct an onto function from A to B? If so, construct an onto function, call it /, from A to B. (Give your function as a set of ordered pairs.) If it is not possible to construct such a function, explain why it cannot be done. not, explain why it is not possible to construct such a function. (ii) Is it possible to construct a one-to-one function from A to B? If so, construct a one- to-one function, call it g, from A to B. If not, explain why it is not possible to construct such a function. (iii) Is it possible to construct a bijective function from A to B? If so, construct a bijection function, call it h, from A to B. If not, explain why it is not possible to construct such a function. (iv) If it is possible to construct a bijective function from A to B, use the bijection you constructed in partiii) and give its true functional inverse, h-, as a set of ordered pairs. If it was not possible to construct a bijection from A to B, write "N.A." [24 pts]