Hashing - General Questions

The keys 65, 87, 43, 89, 90 are inserted in this order into a hash table of size 11 using h(k) = k mod 11 and linear probing. At which index is 90 stored?

Separate chaining handles collisions by:

The keys 50, 15, 76, 13, 86 are inserted in this order into a hash table of size 10 using h(k) = k mod 10 and linear probing. At which index is 86 stored?

The keys 65, 63, 64, 26, 33 are inserted in this order into a hash table of size 11 using h(k) = k mod 11 and linear probing. At which index is 33 stored?

Primary clustering is a problem of: