Exercise 4: hash tables (27 points). Consider a hash table with m 11 slots and using the hash function h(k)m(kA kAwhere A (V5 1)/2 and k is a ntber. Consider the keys k-3,6,14,71,74, 60,51,7,1 (in that order) 1. (3 points Give h(k) for each of those keys. Now, consider inserting those keys in the order given above into the hash table. Show the final table in these two cases: 2. (12 points) Chaining using as hash function h(k). 3. (12 points) Open addressing using linear probing and the same hash function h(k