Consider inserting the keys 10, 22, 31, 4, 15, 28, 17, 88, 59 into a hash table that has 13 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 13. [8 points] b) Using open addressing with the auxiliary hash function h'(k) = k and linear probing.