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 :
a.)Less than 1
b.)Less than n
c.)Less than m
d.)Less than n/2.
My thought:
If all the elements maps to same key then number of collisions would be less than n, am I wrong anywhere