Suppose that we have an operation called perm which takes a word and produces all the permutations of that word. Given a language L we define perm(L) to be the language obtained by taking all the permutations of all the words of L. Show that if L is regular then perm(L) may not even be context-free. [Hint: You will need an alphabet with at least 3 letters.]