For a language L, let Shuffle (L) be the following language: {w: x element L, |w| = |x|, and w is a permutation of the letters in x}. (a) Prove that regular languages are not closed under shuffle. (b) Prove that context-free languages are not closed under shuffle