Write a Python script that reads a multiline file of words (all lowercase words), where there is one word contained on each line of a file called words. txt. As it processes the words in the file, the script should group words that are anagrams of each other together. We define an anagram of a string as a string with the same characters, only that the order of its characters is different. For example, the words "listen" and "silent" are anagrams of each other. After processing the file of words, the script should print each group of anagrams that was found in the file. Each line of the output printed will contain an anagram group, which is a list of words that are anagrams of each other. The list of words in each anagram group should be sorted in alphabetical order of the words. The ordering of all the anagram groups should be sorted by the number of words in each group, in descending order (starting with the anagram group with the most words; if two groups have the same number of words, the ordering between the two doesn't matter). For example, the words file on the left would print the output on the right. Note that there are no words in the file that are anagrams of the word "bat", so it appears on the last line of the output by itself. eat tea aunt tuna aunt nuta tuna ate eat tea listen silent nat tan bat tan ate silent nuta listen nat bat, so it appears on the last line of the output by itself.