Theory of Computation Mid-1 (40 points + 2 bonus points) Bxercise 1 (4 pts). Let M be the following Turing machine ? Input alphabet: Tape alphabet: Set of states: ?={0,1} ?-(0,1,U} Q={go, q?.Q2,la,q.) 141 g1,0, R s L, R , L, L Yar fr For each statement indicate whether it is true or false. 1. M accepts infinitely many strings, i.e. L(M) is infinite, 2. M rejects infinitely many strings. 3. M loops on infinitely many strings. 4. M is a recognizer for some language