In a hash table of size 10, 7 values are inserted. Hash table uses open addressing with hash function h(k) = k mod 10. Technique used in collision is linear probing. Which one of the following choices gives a possible order in which the key values could have been inserted in the hash table assume that initially hash table is empty?

INDEX	VALUES
0	10
1	11
2	21
3	33
4	20
5	63
6	24
7
8
9