(20 points) Simulate the given Turing Machine on the two words given below for 5 steps. If the computation terminates in earlier than 5 steps, indicate it. At each step, write the current state, tape head position and tape content. Assume that the missing transitions go to reject state. a) bbbab b) bb ab, a X,R b R 91 b R 90 xa, L bL y a,R a R 92 An example (not related to the given TM above) is given below. Step 1 C I State: 92 Step 2 a 1 State: 91