A linear-probing hash table of length $10$ uses the hash function $h(x)=x \bmod 10$. After inserting six integer keys into an initially empty hash table, the array of keys is:
$$
\begin{array}{c|c|c|c|c|c|c|c|c|c}
0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 \\
\hline & & 42 & 23 & 34 & 52 & 46 & 33 & &
\end{array}
$$
Which of the following choice(s) are insertion sequences resulting in the above hash table? Assume that the length of the hash table does not change during the insertions. Check all that apply.
- $34,42,23,52,33,46$
- $46,34,42,23,52,33$
- $42,46,33,23,34,52$
- $42,23,34,52,46,33$
