1. [10 marks] Consider a hash table of size M - 7, where we will be storing integer key values The hash function is h(k) k mod 7. In each part below you will draw the table after the following operations occur (do not worry about indicating return values if an operation returns a value), in the order provided (1) put (11, vi) (2) put(10, v2) (3) put(7,v3) (4) put (14, v4) (5) put(2, v5) (6) put(21,v6) (7) remove(2 (8) put(28, v7) a) [3 mark] Draw the table after the operations given above are performed assuming the b) 3.5 marks) Draw the table after the operations given above are performed assuming the c) 3.5 marks Draw the table after the operations given above are performed assuming the collision resolution used is separate chaining collisions are handled by linear probing. collisions are handled by double hashing, using h'(k)-5- (k mod 5) as the secondary hash function