consider the following keys that are hashed into table in the order using giving hash function h(i)=(2i+5)mod11
12,44,13,88,23,94,11,39,20,16,5 Assume hash tables has locations from 0to 10.If hash table uses chaining to handle the collisions what is the probability of new elements'x' fit inside hash table without any collision
I am getting answer 0.5