Following keys have to be inserted in exact order into the hash table with $9$ slots.
$5, 28, 19, 15, 20, 33, 12, 17, 10$
The auxiliary hash functions is $h(k)=K$ mod table size, where table size is $9$ . Which of the following represent the contents of the hash table in correct order after insertions are performed using linear probing?
B is the answer because in linear probing we linearly probe for the next slot. Indexes will be from 0 to 8 since, the hash function is K mod 9.