(b) (12 points; 4 points each) Show the following relationships between the security notions are true. (Explaining in plain English is not sufficient) If a hash function is collision resistant, then it is second-preimage resistant. A collision resistant hash function is not necessarily preimage resistance A preimage resistant hash function is not necessarily second-preimage resis (c) (10 points) State the Birthday problem and prove the result. You must explain why each (d) (2 points) Explain the significance of the birthday problem in relation to hash functions. tant, and vice versa. step in your proof is valid