Demonstrate the insertion of the keys 5,28,19,15,20,33,12,17 into a hash table with collisions resolved by linear probing. Assume that the table has 9 slots and that the hash function is h(k) = k mod 9.

Draw the state of the hash table after every insertion.