The language L is defined as L$=\{($ab$)$n

$($bc$)$n $|$ n$>=1\}$ over the alphabet $\backslash$Sigma $=\{$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 ababbcbc