code just in java!

Q$1-$ Coding Question

$$ Write a class for a $$Contact$$ that contains:

$$ The person$$s name

$$ The person$$s phone number

$$ Write a $$Contact Manager$$ That uses a linked list implementation $($Use the Java linked list no need to make your own$)$ of a hash table to store a contact list in it$.$ It will contain the following:

$$ A private data field for the maximum number of contacts

$$ An ADT List that stores contacts $($List$)$

$$ A constructor that initializes the list with each item in the list being a new

LinkedList$<>()$

$$ A simple hash$()$ method $($it can just $\%$ the length of the string by the capacity$)$ that generates the hash key for a string

$$ A method to add a contact to the hash table

$$ A method to search the hash table

$$ A method to delete a contact from the hash table

$$ Write a test class where you create some contacts and put them into the hash table, try searching and deleting as well.

Q$2-$ Discussion Question

What is a major problem with our hash table we$$ve written above? What kinds of things can we

do to solve this issue?

What are some ways that hash tables are built to deal with collisions?