[5%] A hash table in size of 10 adopts open addressing with linear probing, where its hash function is defined as $h(k)=k \bmod 10$. The table is initially empty. We insert 6 data items into the table, resulting in the following table. Which of the following choices gives a possible order for inserting the data items to the table?