Q$2.$

The language $L$ is defined as $L=\{a^n{b}^n{c}^{3n}|n1\}$ over the alphabet $=\{a,b,c\}.$ Build a Turing Machine that accepts the language $L.$

i$)$ Fxplain shortly the logic behind your design.

ii$)$ Draw the Turing Machine.

iii$)$ Show the exccution chain for the word aabbeccece.