Let M be the following Turing machine: ● Input alphabet: Σ = {0,1} = {0, 1,0} Tape alphabet: I = Set of states: Q = 90, 91, 92, qa, qr} 90 91 92 For each statement below indicate whether it is true or false: M accepts all strings that begin with a 0. M accepts all strings that end with a 0. M accepts infinitely many strings. M rejects infinitely many strings. M loops on some input. 0 9₁,0, R 91,0, R qa 1 9₁, 1, R 9₁, 1, R qr U qr 92,4, L qr

Let M be the following Turing machine: ● Input alphabet: Σ = {0,1} = {0, 1,0} Tape alphabet: I = Set of states: Q = 90, 91, 92, qa, qr} 90 91 92 For each statement below indicate whether it is true or false: M accepts all strings that begin with a 0. M accepts all strings that end with a 0. M accepts infinitely many strings. M rejects infinitely many strings. M loops on some input. 0 9₁,0, R 91,0, R qa 1 9₁, 1, R 9₁, 1, R qr U qr 92,4, L qr