note: i understand that a turing machine and double pda are equivalent in power. my confusion is how to represent the language

{w1w | w e {0,1}*} via double push down automata. THANK YOU!

6) Suppose we define a double pushdown automaton to have 2 stacks by having transi- tions of the form (g, a, Ai, A2) . (p. Bi , B2), ) ); Ai, A2 {e) are the stack syinbols popped from stack 1 and stack 2, resp. and B.. B2 Uc) are the stack symbols pushed onto stack 1 and stack 2, resp. Briefly explain your idea, then draw the diagram for the double pushdown automaton for the language L = {w1w I w {01}*) where q, p are states, a EUe