1. Use (i) ordinary double hashing (ii) double hashing with Brent's method, to insert the following keys in the order shown, starting with 9, into hash tables of size m=7 using the probe sequences below. In your answer show both final tables with location of each key. (Note: Remember in Brent's algorithm, in the event of a tie in the total additional probe costs of two alternatives, the existing key in the slot stays where it is.) (b) Calculate the average cost of successful search in the final table for each of the two methods above. Key b(k,0) b(k,1) b(k,2) h(k,3) h(k,4) h(k,5) h(k,6) 9 2 0 5 3 1 6 4 12 5 1 4 0 3 6 2 6 6 1 3 5 0 2 4 15 1 2 3 4 5 6 0 2 2 5 1 4 0 3 6 16 2 4 6 1 3 5 0 (c) Could combining pass bits with Brent's method be done? Would it be useful? Briefly explain. 1. Use (i) ordinary double hashing (ii) double hashing with Brent's method, to insert the following keys in the order shown, starting with 9, into hash tables of size m=7 using the probe sequences below. In your answer show both final tables with location of each key. (Note: Remember in Brent's algorithm, in the event of a tie in the total additional probe costs of two alternatives, the existing key in the slot stays where it is.) (b) Calculate the average cost of successful search in the final table for each of the two methods above. Key b(k,0) b(k,1) b(k,2) h(k,3) h(k,4) h(k,5) h(k,6) 9 2 0 5 3 1 6 4 12 5 1 4 0 3 6 2 6 6 1 3 5 0 2 4 15 1 2 3 4 5 6 0 2 2 5 1 4 0 3 6 16 2 4 6 1 3 5 0 (c) Could combining pass bits with Brent's method be done? Would it be useful? Briefly explain