Why deletion is a complicated process for hashing?

None of the options contain the correct explanation.

Because after deletion, we must update the existing hashing formula to overcome the memory gap issue.

Because we cannot simply mark that $($i$.$e$.$ deleted$)$ slot as empty in a hash table. Doing so might make it impossible to retrieve any key $($k$)$ during whose insertion we had probed$/$traversed over that $($i$.$e$.$ deleted$)$ slot.

Deletion is not a complicated operation in Hashing. The process is similar in terms of complication to any other operation $($i$.$e$.$ searching, insertion$)$ performed on a hashing table.