6. Consider a Pushdown Automata with TWO STACKS. Show that this machine is more powerful than a single stack PDA. (Use the language L = {aninch} which is not a CFL. Explain how a two stack automata can accept this language.) HINT : Give a table representation of the 2PDA - it should have 7 columns : state, input, stack 1, stack 2, new state, stack 1 operation, stack 2 operation