An **anagram** is the result of rearranging the letters of a word to produce a new word.
**Note:** anagrams are case insensitive
Complete the function to return `true` if the two arguments given are anagrams of each other; return `false` otherwise.
## Examples
* `"foefet"` is an anagram of `"toffee"`
* `"Buckethead"` is an anagram of `"DeathCubeK"`
def is_anagram(test, original):
    a = list(test.lower())
    s = list(original.lower())
    if len(a) != len(s):
        return False
    else:
        for i in a:
            cond = False
            k = 0
            while k != len(s) and cond == False:
                if i == s[k]:
                    a.remove(i)
                    s.remove(i)
                    cond = True
                k += 1
            if cond == False:
                return False
        if len(a) != len(s):
            return False
        else:
            return True
def is_anagram(test, original):
    a = list(test.lower())
    s = list(original.lower())
    if len(a) != len(s):
        return False
    else:
        for i in a:
            cond = False
            k = 0
            while k != len(s) and cond == False:
                if i == s[k]:
                    a.remove(i)
                    s.remove(i)
                    cond = True
                k += 1
            if cond == False:
                return False
        if len(a) != len(s):
            return False
        else:
            return True