a) Take an initially empty hash table with 6 slots, with hash function h(x) = x mod 6, and with collisions resolved by chaining. Draw a sketch of what happens when inserting the following sequence of keys into it: 35, 2, 18, 6, 3, 10, 8, 5. b) Repeat part (a) but with the following three changes: the hash table now has 9 slots, the hash function is h(x) = x mod 9, and collisions are resolved by linear probing.