Data Structure and Algorithm analysis: Hashing

Q1. Given input [21, 19, 109, 81, 35, 32, 29] and a hash function h ( x ) = x mod 10, show the resulting table

a- (25 pts) separate chaining hash table,

b- (25 pts) hash table using linear probing,

c- (25 pts) hash table using quadratic probing,

d- (25 pts) hash table with second hash function h ₂ ( x ) = 7 ( x mod 7 ).

For this question, the table size is 10 as it can be seen from main hash function.

you need to show all of your computations. If you just provide final answer without any computation, you can get 20% of the score if your answer is correct. So, please show your work to get full credit.

***If a number cannot be placed in the table with current hash functions, explain the reason and proceed to the next number in the array.