Prove by induction on n that if the TM (below) is started with a blank tape, after 10_n + 5 steps the machine will be in state 4 with the tape reading ... 0(0111)^n 01110 . . . That is, although there are three states with halting instructions, show why none of those instructions is actually encountered, and formulate this into a proof that this machine does not halt when started with a blank tape