Question: I want an easy code using python for this problem 1.1 Anagrams - Two strings are anagrams of one another if the letters of one
I want an easy code using python for this problem

1.1 Anagrams - Two strings are anagrams of one another if the letters of one can be rearranged to make the other. - Ask the user to enter two words. Assume that there are no duplicate letters in a word. - Test if one word is an anagram of the other, by storing all of the characters from the first word in a set, and all of the characters from the second word in another set. (Two sets are equal if they contain the same items - order does not matter)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
