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'?

Consider the Turing machine M=({0, 91, 92, 93}, {0,1}, {0,1,B), , qo, B{q}}) where d is defined as follows: 8 (90, 0)=( 90, 0, R) (qo, 1)=( 41, 1, R) (91, 0)=( 91, 0, R) 5 (91, 1)=( 92, 1, R) 5 (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