Write a full java implementation that covers the process of Open hashing and

including the following

$1.$ Reads the names from the given file "input$\_$file" to hash them using

chaining hashing to solve any collision.

$2.$ Construct an array of objects of type linked list to store names by

their hash keys.$($don$\text{'}$t use a built$-$in methods$)$

$3.$ The size of the array should be $1000$ locations at Least.

$4.$ Initialize all linked lists with the value $****$ in the first node to

indicate that the linked list has no names $($empty linked list$).$

$5.$ Use the hash code and hash function you have learnt in class to find the

hash key.

$6.$ Insert any given name in its proper location depending on its hash

key.$($ use the absolute value in the end$)$

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

processes.

$8.$ A method to search for a name in the array and return its index and

location in the linked list

$9.$ A method to return the size of the linked list at any given index.

$10.$Use a menu for your choices, read, delete, search, print $....$ ets.

$11.$Include any additions you see it is important.

keep place for the input file i will add it

after deleting return the stars to indicate that is empty place