Guidelines for writing pseudocode:

1. C/Java/Python instructions are fine. But do not write object-oriented additions. Do not declare or use any class. Declare only procedures (if necessary) and explain in words what each procedure does, and what is the use of each parameter.

2. One instruction per line

3. Match the brackets with a horizontal line

4. Number your lines

5. Write down if your array is indexed 0...n1 or 1...n.

Problem 5 1. Draw the 11-item hash table resulting from hashing the keys 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, and 5, using the hash function h(i) (21 + 5) mod 13 and assuming collisions are handled by chaining. Here the hash table has 13 slots. = 2. What is the result of the previous exercise, assuming collisions are handled by linear probing? In the notation from the textbook, use h as defined above for the auxiliary function h'. 3. Show the result of Exercise 1 above in this problem, assuming collisions are handled by quadratic probing, up to the point where the method fails because no empty slot is found. In the notation from the textbook, use h as defined above for the auxiliary function h' and C1 = 0, C2 = 1. Also, the key will not be inserted if no empty slot is discovered with at most 10 probes. 4. What is the result of Exercise 1 above in this problem, assuming collisions are handled by double hashing using a secondary hash function h2(k) = 7 (k mod 7)? In the notation from the textbook, use hi = h