Perform the following operations for the Hash table below:

• add - insert new item
• remove - delete an item
• search - search an item

Your task is to show which table positions are visited during each operation.

The hash function is h_i(k) = (k+i²) mod 19, where k is the key and i=0,1,2,.. is the number of attempts.

You can see only the first item (i.e., Current key) in the queue of items/operations. Click the table positions in order to show how the operation is performed. For some operations, you need to click many times.