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 it appears that the removed entry was never inserted in the first place.