Hi

plz help to solve questions 1and2 step by step.

Q1- In the following, say our hash function for n (h1) is n % 20 and our second hash (h2) function, where applicable, is (n % 7) + 1. Say we use separate chaining for collision resolution. Beginning with an empty hash table, we insert the following.

[8, 38, 3, 5, 28, 18, 65, 83]

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

Q2-

Show the result of sorting each decimal digit column, using radix

sort, on the list [215, 173, 217, 2, 119, 23].

Thx