Consider the following hash table array that uses open addressing for collision resolution (only keys are shown in each array entry).

| | |15|81|42|109|500| |8 | |10| | |

If a quadratic probing function p(j) = (-1)^(i-1) * ((i+1)/2)^2 is used, what is the sequence of keyed items that is examined when attempting to insert the item with key 29?

(Note: the p(j) used here is the same as used at the bottom of page 106 in the textbook)

(Note: only the key of each item is shown.)

• First item examined has key:
• Second item examined has key:
• Third item examined has key: