Q. If h is any hashing function and is used to hash n keys in to a table of size m, where n<=m, the expected number of collisions involving a particular key x is :

• Less than 1
• Less than n
• Less than m
• Less than n/2

Submit