The language L is defined as L={a"b"c" | n21} over the alphabet E={a,b,c}. Build a Turing Machine that accepts the language L. i) Explain shortly the logic behind your design. ii) Draw the Turing...

the language L is defined as L={an b n c 3n | n≥1} over the alphabet Σ={a,b,c}. Build a Turing Machine that accepts the language L. i) Explain shortly the logic behind your design. ii) Draw the Turing Machine. iii) Show the execution chain for the word aabbcccccc.

Extracted text: The language L is defined as L={a"b"c" | n21} over the alphabet E={a,b,c}. Build a Turing Machine that accepts the language L. i) Explain shortly the logic behind your design. ii) Draw the Turing Machine. iii) Show the execution chain for the word aabbccccee.