Exercise 1 (2 pts). Let M be the following Turing machine: Input alphabet: Tape alphabet: Set of states: ?={0.1} ?-(0,1,U} Q={go,J1,92,Ja, 70 91,0, R 92,1,R g 11,0, R a For each statement indicate whether it is true or false. 1. L(M) contains all binary strings beginning with a 0 (equivalently, M accepts every binary string beginning with a 0) 2. L(M) contains all binary strings ending with a1 (equivalently, M accepts every binary string ending with a I)