Q64,p3,j14. If h is chosen from a universal collection of hash functions and is used to hash n keys into a table ofsizem, where n less than m, the expected number of collisions involving a particular key K is

(A) less than 1

(B) less than lg n

(C) greater than 1

(D) greater than lg n

Answer A.

Hashing is also a method of sorting.