20. The hash function from class 111x if |x| = n bits J(x) = is collision resistant, if H(x) is collision resistant, but not pre-image resistant. Briefly explain why this so. 21. Recall the hash function from the assignment. The assignment asked you to prove that What we can say about the converse statement? ?77 22. If a hash function outputs an n-bit hash. How many times do we expect to compute this function (with random inputs) before we get a collision? What name to we give to this result? 20. The hash function from class 111x if |x| = n bits J(x) = is collision resistant, if H(x) is collision resistant, but not pre-image resistant. Briefly explain why this so. 21. Recall the hash function from the assignment. The assignment asked you to prove that What we can say about the converse statement? ?77 22. If a hash function outputs an n-bit hash. How many times do we expect to compute this function (with random inputs) before we get a collision? What name to we give to this result