1. Consider the Turing machine R1 which is defined by ={a,b},={a,b,c,B} and states Q={q0,q1qa,qr} and whose program is the following five tuples: (q0,a,q0,c,R)(q1,a,q0,b,L)(q0,c,q0,a,R)(q1,b,qr,c,R)(q0,b,q1,b,R)(q1,c,q0,a,R)(q0,B,qr,a,R)(q1,B,qa,b,R) (i). Carry out the computation of R1 on the string aba. Show your work as the tape head travels over the tape, changing states and symbols. State what string is left on the tape when this computations halts, and say whether the TM accepts aba or rejects it. (ii). Do the same as you did in part (i) except for the computation of R1 on the string bbaba. (iii). Do the same as you did in part (i) except for the computation of R1 on the string abaab