Exercise 1 (2 pts). Let M be the following Turing machine 0 Input alphabet: ?={0,1} Tape alphabet. ?-(0,1,U} Set of states: -1a o 1O,R 92.1,R 1 1,0,R )0.R 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 a 1 (equivalently, M accepts every binary string ending with a 1)