Lost on my review on hash functions and could use a bit of assistance

3. Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table that has 9 slots. Demonstrate what happens when the keys are inserted into a hash table: a) with collisions resolved by chaining and the hash function h(k) = k mod 9 6 points] b) using open addressing with the auxiliary hash function h'(k) = k and double hashing with h1(k)-k and h2(k) = 1 + (k mod (m-1). [6 points)