I am really in need of help with this program I am so lost and none of the solutions people are giving are correct I have posted 10 times already with no help so I would really appreciate a correct answer! Thank You for your help I aprreciate it. In JAVA (you can use NetBeans compiler), write a PhoneBook that will have FOUR SEPERATE CLASSES,

Person: which represents the name and phone number of a person, you will store instances of this class in the phone book

PhoneBook: which represents the phone book. The class should contain a binary search tree as a data field. This tree contains the people in the book.

Menu: which provides the programs user interfacecontains a main() method which creates a PhoneBook object, displays the PhoneBooks methods as different menu selections and invokes the PhoneBook method the user selects

HashTable: which is the ADT HashTable. This is the class which contains the PhoneBooks collection of data (all of the People objects in the PhoneBook), as well as the operations which can be performed on that collection of data.

This Phone book should be able to...

Add: Adds a persons name and phone number to the phone book.

Delete: Deletes a given persons name and phone number from the phone book, given only the name.

Find: Locates a persons phone number, given only the persons name.

Change: Changes a persons phone number, given the persons name and new phone number.

Quit: Quits the application, after first saving the phone book in a text file.

The key to this project is in the implementation of a hashCode() method, which translates a key value into a numeric index value, which identifies the location in which an item will be stored in the hash table. You must also consider how to resolve a collision. This is when two key values are translated into the same index value. Thank You!