input: Write a function to determine if two strings are anagrams. Two strings are considered anagrams if they contain the same characters with the same frequencies. If they are anagrams return True else return False.
  assert is_anagram("abcd", "cbda") == True
  assert is_anagram("abcd", "dcba") == True
  assert is_anagram("abcd", "abce") == False
  assert is_anagram("listen", "silent") == True
  assert is_anagram("python", "typhon") == True
output: def is_anagram(s1, s2):
      return sorted(s1) == sorted(s2)