Problem 4. A PDA with two stacks (see Figure below) is a finite-state automaton which has two stacks it can examine, push, and pop. Note that it can push one stack while popping the other, so the stacks will not necessarily have the same depth. Show that a PDA with two stacks can simulate a Turing machine. Describe the simulation at the same level of detail as in the previous problem. Problem 4. A PDA with two stacks (see Figure below) is a finite-state automaton which has two stacks it can examine, push, and pop. Note that it can push one stack while popping the other, so the stacks will not necessarily have the same depth. Show that a PDA with two stacks can simulate a Turing machine. Describe the simulation at the same level of detail as in the previous