2. a. Write out all states and moves for a standard one tape TM to accept the language (w w is a string of ab & such that (i) odd length, and (ii) center character is a. What is the O of your machine (and why? b. Describe (English) how you would accept this language with a multi-tape TM. What is the O of this machine (and why)? c. TM's can compute values of a function. Take the function f(w)- w where w is any string over fa,b.c). That is, f takes a string w and reverses it. Describe (English) a TM (one or multi tapes) to compute this function. What is the O of your machine, and why? 2. a. Write out all states and moves for a standard one tape TM to accept the language (w w is a string of ab & such that (i) odd length, and (ii) center character is a. What is the O of your machine (and why? b. Describe (English) how you would accept this language with a multi-tape TM. What is the O of this machine (and why)? c. TM's can compute values of a function. Take the function f(w)- w where w is any string over fa,b.c). That is, f takes a string w and reverses it. Describe (English) a TM (one or multi tapes) to compute this function. What is the O of your machine, and why