Write a function called anagrams(file_name) that accepts a file_name that contains a list of words (one per row) and returns the larget set of anagrams in the word list. i.e. art,tar,rat would be a set of 3. If there is a tie it should return one of the sets. First try running it on test.txt, but it should run in a reasonable amount of time (<3m) if using unixdict.txt.

Answer rating: 100% (QA)

Heres a Python function called anagrams that reads a list of words from a file and returns the large... View the full answer