Hashing by Chaining

Demonstrate what happens when we insert the keys 6, 8, 10, 9, 7, 5, 4, 13, 23, 1, 5, 7, 12, 4 into a hash table with collisions resolved by chaining.

Let the table have 9 slots, and let the hash function be h(k) = k mod 9

Count up the number of collisions

How many collision would the hash table have if you use h(k) = k mod 7?

Note: Hash table indexes starts from zero.