Solve problem only - only vote if problem is solved

Multi-tape Turing Machine Transition for multi-tape Turing machine :QQ{L,R}(q1,a1,,ak)=(qj,b1,,bk,L,R,,L) 1 2 Simulation - Initially, \# w1w2wn#### - For one move simulation, scan the first \#, then the second \#, etc. - It one tape goes out of its \#, move the rest of tape in order to get one space for it. (stapid, slow) 3 4 Problem Design a simple multi-tape Turing machine to accept the language {0n1nn0} 1. Briefly describe your design. 2. Show the number of steps to recognize a string of length m. 3. Explain why Turing machine is more powerful than DFA