1. This question is about hash tables. Insert in order the keys 67, 26, 39, 44, 57, 65, 89, 64, 97, 71 successively into two separate hash tables a) Consider the first hash table with m- 13 slots for storing keys of integers, and collisions are resolved using double hashing. The hash function is given as follows: h(k,i) (h(k)+i*h(k) mod m h(k) k mod m h(k) kmod(m-2) Draw the final state of the hash table showing the positions of the keys (10%) Consider the second hash table with m-7 slots for storing keys of integers, and collisions are resolved using chaining. Draw the final state of the hash table. b) (790)