Turing machines

(a) Let L -{re{0,1)* |r ends with 1). First describe in English, and then give a full description of a deterministic Turing machine M = Q, , .90, qa, qr, deciding L. Your English descrip- tion should explain what your Turing machine is doing, and your full description should include a table for . Use only states qo, q, ga and gr, and take -{0, i, } (b) List a sequence of configurations describing the computation of your Turing machine from the previous subquestion on the string 010. Now do the same for the string 11. Finally, what sequence of configurations would your Turing machine go through on blank input