- Input alphabet: ={0,1} - Tape alphabet: ={0,1,} - Set of states: Q={q0,q1,qa,qr} For each statement below indicate whether it is true or false: 1. M accepts some strings that contain two occurrences of 1 . 2. M rejects some strings that contain two occurrences of 1 . 3. M accepts some strings that contain two consecutive occurrences of 1 . 4. M rejects some strings that contain two consecutive occurrences of 1 . 5. M loops on some input. Exercise 2 (5 points) Let M be the following Turing machine: - Input alphabet: ={0,1} - Tape alphabet: ={0,1,} - Set of states: Q={q0,q1,q2,qa,qr} For each statement below indicate whether it is true or false: 1. M accepts all strings that begin with a 0 . 2. M accepts all strings that end with a 0 . 3. M accepts infinitely many strings. 4. M rejects infinitely many strings. 5. M loops on some input