Java Coding Program

Insert all words from a large file such as the novel Alice in Wonderland found here http://www.consciouslivingfoundation.org/ebooks/new/Lewis%20Carroll%20-%20Alice%201%20-%20Alice%20in%20Wonderland.doc, into a hash set and a tree set.

Time the results. Which data structure is more efficient for inserting data?

Choose a word that is in the novel and record the time it takes to search for that word 100 times. Time the results. Which data structure is more efficient for searching data?

Important: You cannot use both Collection objects in the run of the program. You must run the program twice -- once for each data structure.