4. Three keys 20, 9 and 12 have been hashed into a 7-entry table: 20 Add to this hash table further three keys 10, 16, 250 (in this order), assuming that the hash function is h(k) (3k +5) mod 7, and collisions are handled by: (a) (4 marks) linear probing b) (5 marks) double hashing using the following secondary hash function: h'(k)-5- (kmod 5) (c) (1 mark) Is this an efficient hash map? In both cases show the final hash table