2. [12 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 and configuration at each step and state whether the TM accepts the string or not: b+b, R b-+b, R startqi 2. greject q3 qaccept a-a, L, b+b, L Figure 1: Turing Machine Finite Automata (a) [3 marks] abba (b) [3 marks] ababab (c) [3 marks] bba (d) 13 marks) What language does this Turing Machine describe