Consider a hash table of size 7 with hash function h(x) = x mod 7. Draw the table that results after inserting, in the given order, the following values: 237, 428, 261, 374, 783, 346, 409 for each of the TWO scenarios below: a) When collisions are handled by separate chaining; (2.0 marks) b) When collisions are handled by double hashing using a second hash function h'(x) = (2x 1) mod 5+(1). Hint, the overall (combined) hash function is H(x) = (h(x) +i x h'(x)) mod 7, where i = 0, 1, 2, 3, .... (2.0 marks)