Exercise 1 (4 pts). Let Al be the following Turing machine: Input alphabet: 9 = {0,1) Tape alphabet: r = {0, 1.0) Set of states: Q = {.91.92.4. Gr 90 41 91.0.R 91.0.R 41.1. R 91.1 R er 92, U, L For each statement indicate whether it is true or false. 1. M accepts the empty string. 2. M accepts infinitely many strings. ie. L(M) is infinite 3. At rejects infinitely many strings. 4. A loops on infinitely many strines