2. For each of the following collision resolution techniques, insert the keys 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, and the hash function h ( k) = ( 3k + 5 ) mo d 11 into a hash table of size 11 in the order given. Show your calculations. (a) Chaining 0 1 2 3 4 5 6 7 8 9 10 (b) Open addressing with linear probing (step 1). 0 1 2 3 4 5 6 7 8 10 (c) Open addressing with double hashing and secondary hash function h2(x) = 1 + (x mod 8). 0 1 2 3 4 5 6 7 8 9 10 (d) Open addressing with Quadratic probing. 0 1 2 3 4 5 6 7 8 9 10