Write a method that takes an array of Strings and returns the largest group of words that are anagrams of each other. Do to this, sort the array with a Comparator that compares the sorted character...

Write a method that takes an array of Strings and returns the largest group of words that are anagrams of each other. Do to this, sort the array with a Comparator that compares the sorted character representation of the words. After the sort, any group of words that are anagrams of each other will be adjacent in the array. Test your method by writing a program that use words read from a file.