Problem (Proving properties of functions) Let A, B be two sets. Let f be a function from A to B and let g be a function from B to A. For each of the following functions F1,F2, F3 determine whether the stated property is true or false. Justify your answer, hence, if the property is true then prove it, otherwise, disprove it. A A 1. The property: if f and g are injective then F is injective, where F is given by: F1x gf(x)) BXA AXB 2. The property: iff and g are injective then F2 is injective, where F2 is given by: F2(x, y) = (g(x),f()))