A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is

as shown below.

Which one of the following choices gives a possible order in which the key values could have been inserted in the table? (Assume that Linear probing was used to resolved collision)