Demonstrate what happens when we insert the keys 5, 28, 19, 15, 20, 33, 12, 17, 10 into a hash table with collisions resolved by chaining. Let the table have 9 slots, and let the hash function be (k) = k mod 9. Assume that we insert elements to the beginning of the linked list for chaining.