Binary search tree and a Hashing table.

In this project you will use a given binary search tree and a hashing function. ## Deliverables 1. Create a class for a zipcode containing zipcode, city, and state. 2. Build a hash table using the given hashing code with your class by reading in each record from the zipcode file. 3. The hash table should be able to return the city and state for any zipcode. 4. Create a class for a company that has the company name and zip code. 5. Build a binary search tree using the given code with your class by reading in each record from the company file. 6. Ask the user for a company name, and print the company name, city and state by performing searches of your tree and hash table. 7. You must use the given code (check attachments) for the tree and hash table. Note: The Hashing Table is for the zipcode file, and the Tree is for the company file. Check the attachment for all the files that must be used to implement this task. ## Platform You should submit the source files and executable file. It MUST be compilable on apache servers.