Write the pseudocode for the removeoperation when linear probing is used toimplement the hash table.

What will be an ideal response?

```
//Removes a specific entry from the dictionary, given its search key.
//Returns true if the operation was successful, or false otherwise.
remove(searchKey: KeyType): boolean
{
index = getHashIndex(searchKey)
Search the probe sequence that begins athashTable[index] for searchKey
if (searchKeyis found)
{
Flag entry as removed// No need to actually remove the entry
itemCount--
return true
}
else
return false
}

```