Develop an algorithm to search and remove data from a hash table using the open addressing technique.
Aim
Implement a hash table using open addressing with linear probing.
Prerequisites
To solve this activity, you have to implement the following methods in the OpenAddrHashTable.java file:
publicvoidput(Kkey,Vvalue){ //…}privateintsearchPosition(Kkey){ //…}publicvoidremove(Kkey){ //…}publicOptionalget(Kkey){ //…}
Steps for Completion

Study the pseudocode shown in Snippet 3.3 and Snippet 3.4 (shown below) and implement them in Java.
The container class OpenAddrPair will hold your key and value in the hash table.
Have a flag on this container to indicate when an item is deleted.
Use this flag in the put operation to overwrite it if it is deleted. You can use this flag to optimize your get method using the filter method.

insert(key,value,array)s=length(array)hashValue=hash(key,s)i=0while(i