Write a full implementation that covers the process of hashing which includes the following

$$ Reads two fields of data from the user which represent the name and age of student.

$$ Insert the read data into hash table$($array of objects$)$ using the name as a key by Using the hash code and hash function you have learnt in class to find the hash key.

$$ Repeat the previous steps until the user enters a negative value for age.

$$ Solve any collision using the linear probing mechanism.

$$ Your implementation should have methods for add, delete, and search processes.

$$ Fill $***$ for the name of any deleted object.

$$ Start with a table of size $8$ at the beginning and when the load factor becomes greater or equal to $0\mathrm{.}75$ do rehashing for the table with new double size.

$$ Print the hash table after any insertio by java app