that's a question of Turing machine for question a and b, I got halts on state q2 and halts on state q3 respectively, is this correct? and for c should this be a language that accepts string input with at least three '1' or has exactly three '1' and end with '1'? DO NOT COPY FROM CHEGG OR ANY OTHER WEBSITE.ANSWER STEP BY STEP! Consider the Turing machine M=({qo, 91, 92, 93}, {0,1}, {0,1,B}, 5, qo, B{ 93}) where is defined as follows: 5 (90,0)=( 90, O, R) 8 (90,1)=( 91, 1, R) (q, 0)=( 91, 0, R) (91, 1)=( 42, 1, R) o (92, 0)=( 92, 0, R) 8 (92, 1)=( 93, 1, R) a) If initially "1100" is placed on the tape, which state will the machine be halting at? Assume the head of the machine initially points to the left-most 1. b) If initially "1101" is placed on the tape, which state will the machine be halting at? c) What is the language accepted by M