http://ickivrg5jucpkdfw5d6qeja6srtpox7yofkyygc44gnwbpj2tf2mekqd.onion
(a) (4 marks) Consider the following hash table that uses the hash function \(h(k) = k\ \%\ 11\), and uses double hashing with the secondary hash function \(h_2(k) = k\ \%\ 4 + 1\) to resolve collisions: Index 0 1 2 3 4 5 6 7 8 9 10 Key 36 16 3 21 i. Insert the following keys into the hash table in the order given, and show the state of the hash table after each insertion. (3 marks) 12, 5, 47 ii.