HASH TABLE C++ (theory)

please provide detailed explanation with code and worded explanation as well as visualized (as in drawing):

Describe how to perform a removal from a hash table that use chaining method 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.