Consider the Turing machine M, M=({q₀, q₁, q₂, f}, {0, l},{ 0, l, B}, ,q₀, B, {f}), whose transitions are defined below. (q₀ ,0) = { ( q_1, 1, R) } (q₁ ,1) = { (q₂, 0, L) } (q₂ ,1) = { (q₀, 1, R) } (q₁ ,B) = { (f ,B, R) } (a) Provide the execution trace of this machine on the input 011.

(b) Describe the language accepted by M.

(c) Suppose that the transition function defined above is modified so that the transition (q₀ ,0) = { (q₁, 1, R) } is replaced by the following. (q₀ ,0) = { (q₁, 1, R),(q₀ , 0 ,R) } Describe the language accepted by M.