How is it less than 1?

#1

the collisions will be dependent on the collision handling scheme, which is not specified.

#2

plz send the complete question and options

quiz questions are not visible to us

#3

Q4. 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 less than n/2 less than s less than n less than 1

#4

one thing is missing in this which is
h is chosen from a universal collection of hash functions
If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m, where n ≤ m, the expected number of collisions involving a particular key x is less than 1.