Could you answer this question?

The answer is 0.

We do hashing where we solve collisions by linear probing. We use a hash table of size 9 with indices starting at 0 . We use the hash function h(k)=kmod9. We add the keys 5,28,19,15,20,33,12,17,10 in this order to the initially empty hash table. At which index is the key 10 stored? At index 0. At index 1. At index 2. At index 8