Pls mainly focused on part c,d.

For part a,b, I have done but need an answer for checking so just give me a simple answer.

Thx a lot, I will give a thump up for your help.

1. Hashing (18) Given the input {64, 72, 28, 86, 18, 56, 67, 90, 2, 36) and a hash function h(x) = x mod 10, show what happens when each element in the list is inserted into the hash table of size 10 using the following collision policy. (a) (5) Open hash table. Explain what method of insertion you are using. (b) (5) Closed hash table using quadratic probing (specify your probing function). (c) (4) What are the advantages and disadvantages of the various collision strategies in the first two questions? Justify your answer. (d) (4) Which hash function is a better hash function for the above sequence: (1) hi)mod 12 or (2) h2(x mod 13? Justify your answer. Note that the size of hash table will change according to hash function