The language accepted by this Turing marching is all words with an odd number of letter that have 'a' as the middle letter. Show that this is true by explaining the algorithm the machine used and meaning of each state. Pay attention to the two necessary parts that must always be demonstrated:

(i) Anything that has an 'a' in he middle will get to HALT.

(ii) Anythig that gets to HALT has an 'a' in the middle.

R 19 Turing Machines ems 1 and 2, consider the following TM: (b,b,L) (b,a,L) (b,b,L) (a,A,L) (a,a,L) (a,a,R) (b,b,R) 4 1 START (b,b,R) (a,#,R) a,a. R) HALT (a,a,R) (b,b,R)