My attempts at this kept giving me exception errors, I would like to compare and see what it should actually look like. I really need help with is, pleaseCreate a Java program that uses a stack to return a list containing all permutations of a given string, and then checks to see which ones are English words. It should read words from the input and create and check the permutations for each word. For example, there are six permutations of the letters in the string "tra": tra, rta, rat, tar, atr, artimplementation should include a GetPermutations class (this is the client class, driver class, demo class or console class) and a PermutationsCalculator.the program should determine which of the permutations is an English word by looking them up in a dictionary text file (just a fe words).PermutationsCalculator class Fields:a stack for calculating the permutations; an ArrayList to hold all permutationsan ArrayList to hold unique permutations.an ArrayList to hold the unique English words from the permuatationsPermutationsCalculator class methods:ArrayList allPermutations(String word) will find all the permutations of the parm, store them in the all permutations ArrayList and return that ArrayList.ArrayList uniquePermutations(String word) will find all the unique permutations, store them in the unique permutations ArrayList and return that ArrayList.ArrayList uniqueWords(String word) will find the unique English words in the all permutations ArrayList, store them in the unique words ArrayList, and return that ArrayList.int numDuplicates() will return the number of duplicate permutations found.GetPermutations class:Create an output file named "perms.txt".Create an output file named "analytics.txt".Prompt for the name of a dictionary text file (just a few words), then call a Dictionary constructor to read the words and create the dictionary.Use a loop to read words from the keyboard until the user wants to stop.For each word entered by the user:Create a PermutationsCalculator and find all permutations, the unique permutations, and the unique English words.Print the original word, all permutations of the word, all unique permutations of the word and all the unique English words to the output file.Calculate and print to the analytics file the following for each word: the word itself, the total number of permutations, the number of duplicate permutations, the percentage of permutations which were duplicates, the number of English words and the percentage of permutations which were English words.Calculate the following overall analytics and print them to the analytics file: the total number of words input by the user, the average length of the words input by the user, the total number of permutations generated, the total number of English words found, and the percentage of permutations which were English words. Sample Outputperms.txt:---WORD PERMUTATIONSOriginal Word: tarAll Permutations of tar:tar atr tra rta art ratUnique Permutations of tar:tar atr tra rta art ratPermutations of tar that are valid English words:tar art ratOriginal Word: acreAll Permutations of acre:acre care arcerace craercae acer caer aecr eacr cear ecararec raec aerc earc reac erac crearceaсera ecrarecaercaUnique Permutations of acre:acre care arcerace crae rcaeacer caer aecr eacr cear ecararec raаес аеr с еarc reac eraа с crearcea cera ecra recaercaPermutations of acre that are valid English words:acre care raceOriginal Word: tortAll Permutations of tort:tort otrt trot rtot ortt rott totr ottr ttor ttor ottr totrtrto rtto ttro ttro rtto trto ortt rott otrt tort rtottrotUnique Permutations of tort:tort otrt trot rtot ortt rott totr ottr ttor trto rtto ttroPermutations of tort that are valid English words:trot analytics.txt:--ANALYTICS--The total number of duplicate perms for tar is 0.0The average number of duplicates for tar is 0.00The total number of English words for tar is 3The average number of English words for tar is 0.50The total number of duplicate perms for acre is 0.0The average number of duplicates for acre is 0.00The total number of English words for acre is 3The average number of English words for acre is 0.13The total number of duplicate perms for tort is 12.0The average number of duplicates for tort is 0.50The total number of English words for tort is 1The average number of English words for tort is 0.04The total number of words processed is 3.0The average word length is 3.67 charactersThe total number of word permutations processed is 54.0The total number of English words found is 7.0The average proportion of English words is 0.13

Question

My attempts at this kept giving me exception errors, I would like to compare and see what it should actually look like. I really need help with is, pleaseCreate a Java program that uses a stack to return a list containing all permutations of a given string, and then checks to see which ones are English words. It should read words from the input and create and check the permutations for each word. For example, there are six permutations of the letters in the string &#34;tra&#34;: tra, rta, rat, tar, atr, artimplementation should include a GetPermutations class (this is the client class, driver class, demo class or console class) and a PermutationsCalculator.the program should determine which of the permutations is an English word by looking them up in a dictionary text file (just a fe words).PermutationsCalculator class Fields:a stack for calculating the permutations; an ArrayList to hold all permutationsan ArrayList to hold unique permutations.an ArrayList to hold the unique English words from the permuatationsPermutationsCalculator class methods:ArrayList allPermutations(String word) will find all the permutations of the parm, store them in the all permutations ArrayList and return that ArrayList.ArrayList uniquePermutations(String word) will find all the unique permutations, store them in the unique permutations ArrayList and return that ArrayList.ArrayList uniqueWords(String word) will find the unique English words in the all permutations ArrayList, store them in the unique words ArrayList, and return that ArrayList.int numDuplicates() will return the number of duplicate permutations found.GetPermutations class:Create an output file named &#34;perms.txt&#34;.Create an output file named &#34;analytics.txt&#34;.Prompt for the name of a dictionary text file (just a few words), then call a Dictionary constructor to read the words and create the dictionary.Use a loop to read words from the keyboard until the user wants to stop.For each word entered by the user:Create a PermutationsCalculator and find all permutations, the unique permutations, and the unique English words.Print the original word, all permutations of the word, all unique permutations of the word and all the unique English words to the output file.Calculate and print to the analytics file the following for each word: the word itself, the total number of permutations, the number of duplicate permutations, the percentage of permutations which were duplicates, the number of English words and the percentage of permutations which were English words.Calculate the following overall analytics and print them to the analytics file: the total number of words input by the user, the average length of the words input by the user, the total number of permutations generated, the total number of English words found, and the percentage of permutations which were English words. Sample Outputperms.txt:---WORD PERMUTATIONSOriginal Word: tarAll Permutations of tar:tar atr tra rta art ratUnique Permutations of tar:tar atr tra rta art ratPermutations of tar that are valid English words:tar art ratOriginal Word: acreAll Permutations of acre:acre care arcerace craercae acer caer aecr eacr cear ecararec raec aerc earc reac erac crearceaсera ecrarecaercaUnique Permutations of acre:acre care arcerace crae rcaeacer caer aecr eacr cear ecararec raаес аеr с еarc reac eraа с crearcea cera ecra recaercaPermutations of acre that are valid English words:acre care raceOriginal Word: tortAll Permutations of tort:tort otrt trot rtot ortt rott totr ottr ttor ttor ottr totrtrto rtto ttro ttro rtto trto ortt rott otrt tort rtottrotUnique Permutations of tort:tort otrt trot rtot ortt rott totr ottr ttor trto rtto ttroPermutations of tort that are valid English words:trot analytics.txt:--ANALYTICS--The total number of duplicate perms for tar is 0.0The average number of duplicates for tar is 0.00The total number of English words for tar is 3The average number of English words for tar is 0.50The total number of duplicate perms for acre is 0.0The average number of duplicates for acre is 0.00The total number of English words for acre is 3The average number of English words for acre is 0.13The total number of duplicate perms for tort is 12.0The average number of duplicates for tort is 0.50The total number of English words for tort is 1The average number of English words for tort is 0.04The total number of words processed is 3.0The average word length is 3.67 charactersThe total number of word permutations processed is 54.0The total number of English words found is 7.0The average proportion of English words is 0.13

Accepted Answer

Solution:--
 
1)The given question has required for the solution which is to be provided as the Java…