Consider the following keys that are hashed into the hash table in the given order using the hash function H(key) = key mod 11.
12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 21
Where hash table using quarditic probing of mod11 to handle the collisions, after inserting the above keys in table. Then find the number of keys cannot go inside the hash table ________ (value will be a whole number).
I can't understand what is "i"
is it number of collision?