Describe how to perform a removal from a hash table that uses linear probing to resolve collisions where we do not use a special marker to represent deleted elements. That is, we must rearrange the...

Describe how to perform a removal from a hash table that uses linear

probing to resolve collisions where we do not use a special marker to

represent deleted elements. That is, we must rearrange the contents so that

it appears that the removed entry was never inserted in the first place.

Refactor our ProbeHashMap design so that the sequence of secondary

probes for collision resolution can be more easily customized. Demonstrate

your new framework by providing separate concrete subclasses for

linear probing and quadratic probing.