Let M be the following Turing machine: Input alphabet: sigma = {0, 1} Tape alphabet: = {0, 1, } Set of states: Q = {q_0, q_1, q_2, q_, q_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)