10. Solve the following problems about mappings. Tell whether the function is one-to-one, onto, bijection, and justify your answer ( 2 points each) (a) f(m, n) = m2 + n2 in the domain Z x Z -> Z (b) f(n) = ceiling(n/2) in the domain Z -> Z (c) f(a) = d, f(b) = b, f(c) = d, f(d) = a) in the domain fa, b, c, d} > {a, b, c, d'} (d) f(student) = student's social-security-no, where student E discrete-structure-class (e) Give an example of a N - N that is onto but not one-to-one (2 bonus pts) (f) f(x) = -3 x + 4 in the domain R -> R (2 bonus pts)