. T by transposing the letters of the other word. For example, wo words are anagrams if one of the words is made "stop" and "tops" are anagrams. This problem involves reading a dictionary of words, and then generating and printing all words in the dictionary that are anagrams of a uses the Word and AnagramList classes whose incomplete implementations are below. storing the words in a list, given word. The problem /* Holds words in two forms: the original word and the word with its letters in sorted order public class Word public Word (String the Word)I originalWord-theWord; sortedWord-sortWord (: /** Sorts the letters of the word Example: if originalWord "apple", "aelpp" is returned. private String sortWord (f // code goes here public String getWord (0 ..)