Please solve this as soon as possible, I'll be really thankful.

Note: Please try to write it in text format Thank you in anticipation.

The subject is Automata Theory ( Software Engineering).

Q4 (a) Construct Turing Machines for the given regular expressions 1. bib(ab+b*) *a+ 1 + (a+b) 2. (ba+ab") + (aa")* Q4 (b) On the given TM, trace the execution of the input string #aaabaabb (a,A,R) (6.B.R) (#.#.R) (2.0.) (6,6,8) (a.c, R) (6.5, R) START 1 (A,A,R) (B,B,R) (4.4L) (X.X.L) (YY.L) (6,6,L) (a.a.) (6.Y.L) (a.X.L) 5 (a.a.) (5,6L) (A.A.L) (B.B.L) (A,A,L) (B.B.L) (B.B.R) (R) (A,A,R) (R) (A,A,R) (B.B.R) (#.#.R) 10 (B.#,R) (Y...) (A.#.R) (Y...L) (#..R) 11 (*..R) 12 (*.*.R) 13 (...) (B.B.L) (A,A,L) (B.B.L) (L) (A,A.L) (A,A,R) HALT Q4 (a) Construct Turing Machines for the given regular expressions 1. bib(ab+b*) *a+ 1 + (a+b) 2. (ba+ab") + (aa")* Q4 (b) On the given TM, trace the execution of the input string #aaabaabb (a,A,R) (6.B.R) (#.#.R) (2.0.) (6,6,8) (a.c, R) (6.5, R) START 1 (A,A,R) (B,B,R) (4.4L) (X.X.L) (YY.L) (6,6,L) (a.a.) (6.Y.L) (a.X.L) 5 (a.a.) (5,6L) (A.A.L) (B.B.L) (A,A,L) (B.B.L) (B.B.R) (R) (A,A,R) (R) (A,A,R) (B.B.R) (#.#.R) 10 (B.#,R) (Y...) (A.#.R) (Y...L) (#..R) 11 (*..R) 12 (*.*.R) 13 (...) (B.B.L) (A,A,L) (B.B.L) (L) (A,A.L) (A,A,R) HALT