Let A, B, and C be sets, and let f: B C and g: A B be functions. Let h: A C be the composition, f o g, that is, h(x)-f(g(x)) forx E A. Prove, or give a counterexample, for each of the following claims: C. i. If h is surjective, then f must be surjective. ii. If h is surjective, then g must be surjective. iii. If h is injective, then f must be injective iv. If h is injective and f is total1, then g must be injective