- I think that I have managed to show that H_n,m is a strongly 2-universal family of hash functions. However, I'm stuck on the second part of the question. I was only able to show that |T| <= 32 with probability at least 1/2.

If anyone can figure this out please help!

Note: B = {0,1}.