From this example of state machine for turing machine, solve attached problem plz

QUESTION HERE

Here is example of the step-by-step execution for an initial tape input of aa. Blank cells are equivalent to the_symbol; the asterisk (*) indicates the location of the head at each step. The machine always begins in state 0 with the head on the leftmost non-blank square. The machine stops when it is in state 5 or state 6. Transition Note Step State Tape 0 Right, Found an a. Write_ switch to 1 %a a, Right, 1Found an a. Write a, stay in 1 Left, 3Found a.Write_, switch to 3 _, Left, 7 Found an a. Write_, switch to 7 _, Right, 0 Found a_. Write_, switch to 0 Left, 5 Found a. Write_. switch to 5 6 0 i: Accept