Consider the Turing Machine TM T (over the input alphabet = (a, b) given below. (b, B, R) (b, Y, R) (b, B, R) (a, X, R) (A, A, L) Start 2 3 4 (a, a, R) (a, a, R(b, b, R), (A, A, R) 5 (Y, Z, R) (A, A, L) Halt Hint: Trace the execution of the TM on a few strings of as and bs so that you can see how it works. a. What is the shortest word that would be accepted by T? (2) b. What is accept(T)? (2) c. What is reject(T)? (2) d. What is loop(T)? (2)