1. Overview You are to write a program that examines all the words of the English language and creates a list of words with decreasing Scrabble high scores. The program uses an array, ArrayList, Stack and Queue. Scoring Scrabble Words Each letter in the alphabet has been assigned a value based on its relative II...- frequency in English words. Therefore, common letters like R, S, and E are .I.... valued at just 1, while rare letters like (1 and Z are valued at 10. Refer to II...- the diagram for the letter scores. To score a word, add up the score for each of the letters in the word. For example, the score for "aardvark\" is 16 II...- (1+1+1+2+4+1+1+5)_ .- 2. Problem Description Read and store a list of approximately 64,000 English words (provided) from "aardvark\" to \"zygote\". Go through the list and compute a Scrabble score for each word while keeping track of the highest score found so far. Every time a new high score is found, add the word to a stack. Once the program has completed the word list, print the stack of high scores in reverse order from the highest scoring word to the lowest. When it runs, it should print a list that looks like this {shown in two columns): 45 - pizzazz 39 - acclimatization 38 - photosynthesizing 25 - abuzz 37 - electroencephalographs 22 - abjectly 36 - compartmentalizing 21 - abjecting 35 - compartmentalized 20 - abbreviating 34 - blackjacking 19 - abbreviated 33 - blackjacked 17 aardvarks 32 - bedazzling 16 - aardvark 31 - bedazzled We can interpret this list to see that \"aardvark\" was the first highest score with 16 (indeed, it was the first word in the list). It was next beat by "aardvarks" at 17. That high score stood until \"abbreviated" was found with a score of 19. This continued until "pizzazz" scored 45. Going through the rest of the words did not produce a higher score. To make the problem more interesting, the program is going to rotate the list prior to starting the word scoring. Each rotation takes the word from the front of the list and adds it to the end of the list. The program will ask the user for the number of rotations to perform. Page 1 Data Type Requirements This program has strict requirements for the data types that the solution must use, as follows: 0 Array: The program will use a standard integer array to initially store the letter values. 0 ArrayList: The array of letter scores will be used to initialize an ArrayList of Integers. This ArrayList will be used by the program to score each word. 0 Stack: The program will use a Stack of Strings to keep track of the history of the high scoring words. The most recently found high-scoring word will be on the top; the oldest (and lowest) high-scoring word will be on the bottom. 0 Queue: To facilitate rotations, the program will read the list of words into a Queue of Strings. The concrete implementation of the Queue will be a Java LinkedList of Strings