(10 points) Consider the Turing Machine ({90, 91, 92, 93, 94, 95, 9acc, Grej}, {0, 1}, {0, 1, X, 2, }, 0, 90, 9acc, Grej) where is defined as: (q,s) 8((q,s)) (20,0) (q1, 2, R) (qo,1) (qrej, -, R) (qo, X) (qrej, -, R) (qo, z) (qrej, -, R) (q0,-) (qrej, -, R) (91,0) (91,0, R) (91,1) (92, X, R) (41, X) | (91, X, R) (41,2) (qrej, -, R) (91,-) (qrej, -, R) III (q, s) (92,0) (92, 1) (92, X) (92, z) (92,-) (q3,0) (q3,1) (q3, X) (93, 2) (43,-) 8((q,s)) III (q,s) II (q,s) | 8((q, s)) (q3, X, L) (94,0) (9, X, R) (92,1, R) (94,1) (94, 1, L) (92, X, R) (94, X) (94, X, L) (qrej, -, R) (q4, 2) (95, z, R) (qrej, -, R) (q4,-) (qrej, -, R) (qrej, -, R) (q5,0) (qrej, -, R) (94, X, L) (q5, 1) (qrej, -, R) (23, X, L) (95, X) (95, X, R) (qrej, -, R) (95, z) (qrej, -, R) (qrej, -, R) (95,-) (qacc, "w, R) and 8((qacc, s)) = (qacc, -, L) and 8((qrej, s)) = (qrej, -, L) for each s E {0, 1, X, , -} a) Draw the state diagram of this Turing machine. For clarity, in your diagram you may leave out all outgoing transitions from Jace and qrej and all incoming transitions to grej. b) Trace through the first 10 steps of the computation of this machine on input 00110 by listing each configuration of the tape. c) How many steps in total does the computation on 00110 take? d) For each string, determine if it is accepted by this Turing machine or not: -E 0110 00111