Define a family ℋ of hash functions from a finite set U to a finite set B to be ¬-universal if for all pairs of distinct elements k and l in U, Pr {h(k) = h(l)} ≤ ¬, where the probability is taken over the drawing of hash function h at random from the family ℋ. Show that an ¬-universal family of hash functions must have