3. Considering a hash table that has 9 slots and for the hash function, a. use h(k) = k mod 9 and show the result of inserting 5, 28, 19, 15, 20, 33 into the hash table with collision resolution by chaining. b. show the result of inserting these numbers into another hash table using a hash function h(k) = [m(kA mod 1)] for A = (V5 1)/2 with collision resolution by chaining C. show the result of inserting these numbers into another hash table using open addressing with the auxiliary hash function h'(k) = k and linear probing. For these inserted entries, what was the largest number of entries you had to search before finding an open slot