Write java code to build an open-address hashtable

Build an open-address Hash Table to store with size Z=100 social security numbers(SSN) using arrays only. Build the following classes : • [login to view URL] • [login to view URL] 1.A) Use Hash function H(x) = Key%Size. 1.B) [login to view URL] is a class for building and processing Hash Tables, see the description in “[login to view URL]”. 1.C) [login to view URL] is a class/program for testing the HashBag class. [login to view URL] must do the following: 1) Generate a random set S of 10 social security numbers (XXXXXXXXX). Write it to a text file called “[login to view URL]” using format F. 2) Read the SSN from “[login to view URL]” and insert them to an array(Hash Table) T, one-by-one using the chosen Hash function H(x). 3) Display the given Hash Table(array). 4) Let the user enter a SSN: A. Search to see if A is in T. Display the search result(if A is found or not and index of A if it is found). 5) Let the user enter a SSN: B. Remove B if there is B in T. Display B and the remove result(if B is found and removed or not and index where B is removed). 6) Let the user enter a SSN: C. Insert/add C to Hash Table/array T. 7) Display the new Hash Table(array) after the removal and addition. MORE DETAILS IN DOC FILE