1. 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 resulting table after inserting, in the given order, the following values: 19, 27, 12, 47, 15, when: (a) (1 mark] the collisions are handled by separate chaining, (b) (1 mark] the collisions are handled by linear probing. (c) (2 marks the collisions are handled by double hashing using a secondary hash function h'(k) = 5 (k mod 5)