Part1(e) Dertemine whether the Turing Machine accepts or rejects strings “bab” and “bba.(f)Describe in words the conditions under which the Turing machine accepts the input string.Part2(e) Simulate the Turing machine on input ‘abbbaa’. Does it accept? Draw the final two configurations of the Turing machine computation. In the last configuration, the Turing machine is either in the accept or reject state(f) Describe in words the conditions under which the Turing machine accepts the input stringHere is a description of a Turing machine. The input alphabet is (a, b). The state set is:{ qo. 91. 92, 93. 94. qacc qrej )The transition function is given in the table below:zbEbLbqo94a(q1. a, R) (q1. a, R) (92, a, R) (qacc a, R) (qrej. a, R)b(q2. b, R) (q1. b, R) (92, b, R) (qrej. b, R) (qacc. b, R)(qrej. *, R) (Q3. *, L) (q4. *, L) (arej. *, R) (qrej. *, R)(e)Dertemine whether the Turing Machine accepts or rejects strings "bab" and "bba"(f)Describe in words the conditions under which the Turing machine accepts the input string.Here is a description of a Turing machine. The input alphabet is (a, b). The state set is:{ qo. qa. qby qca. qeb qlleft qacc, qrej )The transition function is given in the table below:obqaqbqeaqebAleft(qa. *, R)(qa a, R) (qp. a, R) (qleft. *, L)(qrep *, R) (qleft, a, L)b(qb. *, R) (qa. b, R) (qb. b, R) (qrej. *, R) (qileft. *, L) (qleft, b, L)(qacc *, R) (qca. *, L) (qet> *, L) (qlace *, R) (qlace *, R) (qo. *, R)(e)Simulate the Turing machine on input "abbbaa’. Does it accept? Draw the final two configurations of the Turing machinecomputation. In the last configuration, the Turing machine is either in the accept or reject state.(f)Describe in words the conditions under which the Turing machine accepts the input string