An anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. For example, the word anagram can be rearranged into "naga ram". Or for example, the word binary can be rearranged into "brainy". - source
In this Bite you complete the function below receiving two words and return True/False if word2 is an anagram of word1. See the tests for some interesting anagrams. See if you can use a data structure of the standard library?