Solving Anagrams Step by Step I was briefly looking through some sample Computer Science course questions and came upon one that stated: Create an anagram program in Java that reads a text file and computes the anagrams of the words. If the words are anagrams of each other, put them on the same line; if they’re not, print each one on a new line. The anagram program should create a new text file. The only data structure that you can use is an array. You must create your own sorting algorithms. This was my solution to it. Make sure to