: Give the pseudo$-$code description for performing 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 of the hash table so that it appears that the

removed item was never inserted in the first place.