The Turing machine M has states 9, P, and f. State a is the start state, and f is the accepting state. The input alphabet is (0,1) and the tape alphabet is {0,1,B); B is the blank. The transitions of Mare: 819,0) = (0,0,R) 8(9.1) = (p.0, R) 8(,0) = (p.0, R) 8{p.1) - (9.1.) (P,B) = (t,0,R) (a) On input 100, M Accepts Halts without accepting O Does not halt (b) On input 001, M: Accepts Halts without accepting Does not halt (c) On input , M: Accepts O Halts without accepting Does not halt