Question 4: (a) We insert values 9, 42, 38, 16, 59, and 10, in that order, in an empty Hash Table with open addressing. Write below the array content i hastif the recalculated as h's(h+3)%size to resolve collisions. Sh hash values in sequence and give the total number of colistons. 4 marks values are ow your derivation the 12] (61 What is the probability of a collision if inserting yet another item? (1 mark) Which distinct rehashing constants other than 3 could be used here? (1 mark)