CSCI 3230 Assignment #3 1. (20 points) Consider a hash table of size N- 7 where we are going to store integer values. The hash function is h(k) k mod 7. Draw the table that results after inserting, in the given order, the following values: 5, 15, 12,26, 11. (a) (5 points) Assume that collisions are handled by separate chaining (b) (5 points) Assuming collisions are handled by linear probing. (c 5 points) Assuming collisions are handled by double hashing, using secondary hash function h'(k) 5- (k mod 5). (d) (5 points) What are the advantages and disadvantages of the various collision resolution strate- gies: Separate chaining, Linear probing, Double hashing? Solution