The language a^n b^n c^n is not a CFL. Give a pushdown automaton with 2 stacks that accepts the language. (This shows that 2 stack PDAs are more powerful than a single stack PDA.) Your answer in table...

The language a^n b^n c^n is not a CFL. Give a pushdown automaton with 2 stacks that accepts the language. (This shows that 2 stack PDAs are more powerful than a single stack PDA.)
Your answer in table format must include the headings - state,stack 1,stack 2, new state, stack1 op, stack 2 op