Problem $1$

Demonstrate what happens when we insert the keys $4,19,10,6,20,24,12,8,33$ into a hash table with collisions resolved by chaining. Each element is inserted to the end of the linked list. Let the table have $9$ slots, and let the hash function be h$($k$)=$k mod $9.$