TURING MACHINE Here is a description of a Turing machine. The input alphabet is (a, b). The state set is:{90, 9a, qb, qca, qcb, left, acc, arej}The transition function is given in the table below:9⁰qaqbqca(qa, *, R)(qa, a, R)(qb, a, R)(dleft. *, L)(9b, *, R)(qa, b, R)(qb, b, R)(arej, *, R)(qacc*, R)(qca*, L) (9cb.*, L) (qacc.*, R)(a)Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, ithas executed zero steps.ab*qcb(qrej. *, R)(aleft, *, L)(qacc.*, R)gleft(qleft, a, L)(qleft, b, L)(90,*, R)

Here is a description of a Turing machine. The input alphabet is (a, b). The state set is: {90, 9a, qb, acar 9cb, qleft, qacc, grej} The transition function is given in the table below: 90 qa qb qca qcb qleft (qa*, R) (qa, a, R) (qb, a, R) (aleft, *, L) (qrej. *, R) (aleft, a, L) b (qb.*, R) (qa, b, R) (qb, b, R) (arej. *, R) (left,*, L) (left, b, L) * (qacc.*, R) (qca, *, L) (acb.*, L) (qacc.*, R) (qacc.*, R) (qo, *, R) Draw the configuration of the Turing machine after 3 steps on input "aabba". When the Turing machine is in the initial configuration, it a