Say our hash function for n is n%20 and our second hash function, where applicable, is (n%7)+1. Say we use chaining for collision resolution. Beginning with an empty hash table, we insert the following: 8, 38, 3, 5, 28, 18, 65, 83

a. How will the hash table look after the final insertion? If we then search for 48, how many of the inserted keys will we look at>

b. Say we use linear probing for collision resolution instead. What is the answer to the above question?

c. Say we use doubling hashing for collision resolution. Now what is the answer?