Hashing - General Questions

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?

The keys 77, 89, 91, 37, 66 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 66 stored?

The average time to search in a well-designed hash table is:

When two keys hash to the same index, it is called a:

The keys 13, 85, 45, 57, 62 are inserted in this order into a hash table of size 13 using h(k) = k mod 13 and linear probing. At which index is 62 stored?