As discussed in class, a Turing machine may halt or loop indefinitely. In what situation that will always cause a Turing machine to halt? a. The input symbol is blank. In other words, the tape head is on top of a blank symbol. b. The tape head is back to the left-most square. C. Its current state is either accept or reject: d. The transition funciton tries to move the tape head to the left when the tape head is already at the left-most square. QUESTION 3 1 points s Suppose the current configuration of a Turing machine is 010 97 101. Transition function of this machine at q7 are as follows: 5197, 0) = (99, 1, R) 6(97, 1) = (92, 0, L) What would be the next configuration? a. 0111 99 01 0.010 22 001 C. 011 101 d. 01 q2 0001 QUESTION 4 1 points s Suppose the configuration 110 95 101 yields the configuration 1101 99 01. What is the valid transition function? a. 8(95, 1) = (49, 0, R) b. 8/95, 1) = (99, 0, L) C.895, 1) = (99, 1, R) d. 8/95, 1) = (99, 1.4) QUESTION 5 1 points Suppose the current configuration of a Turing machine is 46 1100 and the transition function is 6(96. 1) = (97, 0, L). What is the next configuration? a. 97 1100 0 0 0 b.097 100 C. Greject 1100 d. 97 0100