4. Assume a Hash table has 9 slots and the hash function h (k) = k mod 9 is used to hash keys 5, 28, 19, 15, 20, 33, 12, 17, and 10 in the table with collision resolution by chaining. (a) Show the hash table obtained after inserting all 9 keys. (b) Under the assumption of simple uniform hashing, calculate expected number of steps a successful search takes. (c) Under the assumption of simple uniform hashing, calculate expected number of steps an unsuc- cessful search takes