Show that a 2-stack PDA (a regular PDA with a second stack), unlike its regular PDA counterpart, recognizes the language {ww | w {a,b}*}. Now show that a 2-stack PDA is as powerful as a Turing Machine, able to simulate each of a Turing Machines moves.

Please type your answer, no handwritten, thank you