Consider inserting 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 in a hash table:

**the answer should be in table form to illustrate, showing the calculations given very similar to the answer given here for linear probe:

If you could sorta explain the method to get this answer please do, I want to understand this for studying sake.

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 hr(k) = k and h2(k) = 1 + (k mod (m-1). [6 points]