Turing Machine Design Design a Turing machine that accepts the following language: Note that 1=20. Example of how to enter the Turing machine: Final/accepting states: 42,43 Transition function: d(0,8)(q1,B,R) d(q8,4)(q2,,L) (41,a)

(40,,R) Important notes: ⚫ the Turing machine should not leave the bounds of the input word (in particular, blank symbols must be left unchanged) ⚫ the Turing machine should be deterministic ⚫ the Turing machine can have at most 23 states ⚫the starting state is always c ⚫ the blank symbol is # ⚫ the tape alphabet consists of single characters (letters or digits) Final/accepting states: Transitions function This question is graded 'all or nothing. You get 10 if your Turing machine is fully correct and 0 otherwise. {an is a power of 2} You have 99 attempt(s) remaining. After these attempts, the solution (or an explanation of the mistake) will be shown to you and you will be assigned a new task.