Answer Happy

Hi, I need some help with the question below. Note this
question has an extra question b.
Consider a hash table of size 11 with hash function h(x) = x mod 11. Draw the table that results after inserting, in the given order, the following values: 55, 35, 54, 30, 77, 59, 65, 96, 125 for each of the three scenarios below: a) When collisions are handled by separate chaining; b) When collisions are handled by linear probing; c) When collisions are handled by double hashing using a second hash function h'(x) (x mod 5) +1. Hint, the overall (combined) hash function is H(x) = (h(x) + i x h'(x)) mod 11, where i = 0, 1, 2, 3, ... d) When collisions are handled by quadratic probing with a quadratic probe function h'(x,i) = (h(x) + 0.5 i+ 0.5 i2) mod 11 where i = 1,2,3,.... - =