(3 points) Consider the hash functions that map 10,1,... ,p - 1 to 10,1,... ,n - 1) where p is a prime greater than m: and the family Prove that H is almost universal in the following sense: for any x, y E {0, 1, ha(x)=(ax mod p) mod m , p-1) and x y, if h is chosen uniformly at random from H then hPa(h (z) = h(y)) 2/m