Number Of Collision
If ‘h’ is the hashing function and is used to hash n keys into a table of size s, where n<=s, the expected number of collision involving a particular key X is
The answer should be less than n as all the n keys could be mapped to a single slot and hence n collisions can occur