Problem: 1

For this programming assignment, you will need to implement a program which will read inthis text file, , and output an alphabetized list of words, and the number of times which they appear in the file.

Link for the file: https://learn-us-east-1-prod-fleet01-xythos.s3.us-east-1.amazonaws.com/5b158bd279e57/1414036?response-content-disposition=inline%3B%20filename%2A%3DUTF-8%27%27TheHuntingOfTheSnark.txt&response-content-type=text%2Fplain&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Date=20200408T042115Z&X-Amz-SignedHeaders=host&X-Amz-Expires=21600&X-Amz-Credential=AKIAZH6WM4PLTYPZRQMY%2F20200408%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Signature=ceeeceabc9cf64ccdb373d8878f45dd0240f0f293a1c2a356d269e9ddbc8485f

Requirements/ Guidelines:

• Youmustuse a Tree data structure (Binary Search tree, etc.)
• You may use whichever Tree implementation you like (Your own, what we did in class, Java's TreeSet, Java's TreeMap, etc.)
• Your outputmustbe alphabetized
• You may read the file however you like (Standard in, IO redirection, etc.)
• Youmay write the output to Standard out, or a file
• On the last line of output, display the highest frequency word, and the number of its occurrences (+1pt)
• Also output an additional list (you may write it to a separate file) which is sorted by number of occurrences, rather than alphabetically (+2pts)

Sample Output "a": 132 "abetted": 1 "able": 3 ... "zones": 1