2. 19 marks] This question requires you to read a Turing Machine and determine if a given string is accepted by the TM. For each string below, show the tape at each step and state whether the TM accepts the string or not: b+b, R b+b, R start-q1 a-L, R 92 U-I, R qreject q3 qaccept aa, L, bb, L Figure 1: Turing Machine Finite Automata (a) 13 marks] abba (b) [3 marks] ababab (c) [3 marks] bba