QUESTION 4 Suppose the configuration 110 95 101 yields the configuration 1101 99 01. What is the valid transition function? O a. 8(95, 1) = (99, 0, R) O b.5(45, 1) = (q9, 0, L) O C. 8(95, 1) = (99, 1, R) O d. 8(95, 1) = (99, 1, L) QUESTION 5 Suppose the current configuration of a Turing machine is 96 1100 and the transition function is 8(96, 1) = (97, 0, L). What is the next configuration? o a. 97 1100 ob.097 100 O O O C. Treject 1100 O d. 97 0100 As in Nondeterministic Finite Automata, to trace a Nondeterministic Turing machine, we use a computational tree. In which condition when we consider a nondeterministic Turing machine accept a string? u One of the branch ends up in accept - At least two branches end up in faccept. O C. All of the branch end up in accept O None of the branch ends up in greject