Let H be a universal family of hash functions from U = {0, 1, . . . , u 1} into a table of size m. Let S U be a set of m elements we wish to hash. Prove that if we choose h from H at random, the expected number of pairs (x, y) in S that collide is m1/2 .