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