Please Provide Detailed Answer. Prove that a PDA that has access
to two stacks is as powerful as a Turing Machine. Such a PDA has
labels on the transition arrows of the form (a, α, β → α' , β' ),
meaning that read an a from the input, pop an α from the first
stack, β from the second stack, and push α' on the first stack, and
β' on the second stack.