a. Write out entire machine (states, alphabet, delta function as diagram) for a one-tape deterministic TM to accept the language You can use either one-way or two-way infinite tape; just note which you use

{ w | w in (a|b)*, |w| is odd, and the center symbol of w is a}

b. Run your TM on the string ababb (show all configurations!)

c. Run your TM on some string that is not accepted (of length >1).