Made easy

Question

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 (key, i) = (H (key) + i) 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).

Comments

All the keys can sit in the hash slots, Answer should be 0

---

yes, all the keys placed into the hash table. how many collision for the above problem( i got 15 collisions)