input: Write a python function to generate all possible anagrams of a given string.
  assert set(getAnagrams("aabc")) == {"aabc", "aacb", "abac", "abca", "acab", "acba", "baac", "baca", "bcaa", "caab", "caba", "cbaa"}
  assert set(getAnagrams("abc")) == {"abc", "acb", "bac", "bca", "cab", "cba"}
  assert set(getAnagrams("a")) == {"a"}
output: def getAnagrams(s):
      from itertools import permutations
      return [''.join(p) for p in set(permutations(s))]