Let ={a,b,c}. Draw the transition graph of a standard Turing Machine (TM) that accepts the language:

Write the sequence of moves done by the TM when the input string is v=ccbcb. Is the string v accepted?

L-i(ab)" cuva: n > 0, w E * and w contains the string cbc]