It is better to have some explainations.

Thanks

Question 5 (12 marks): Hash Table In a double hashing scheme, the initial hash function is H(k) - k mod 11, where k is the numerical key. If needed, subsequent hash functions are Hi(k)-(H(k) + *0(k)) mod 11. where G(k)-5 - (k mod 5) and i increases from 1 by steps of 1 until no further collision occurs. Fil1 in the values in Table 1 to trace the insertion of the following six keys: 7, 9,20, 88, 42, 51 Table 1: hash table with double hashing after each insertion. 0 4 10 After 7 After 9 After 20 After 88 After 42 After 51