10. (11pt) Suppose that h is a secure hash that generates an n-bit hash value. (a) (2pt) What is the expected number of hashes that must be computed to find one collision? (b) (3pt) What is the expected number of hashes that must be computed to find 10 collisions? That is, what is the expected number of hashes that must be computed to find pairs (xi, Zi) with h(xi) = h(zi), for i = 0,1,2,..., 9? (C) (opt) What is the expected number of hashes that must be computed to find m collisions? How can we interpret the results? That is, when the m it become easier or harder to find collions? grows, does