5. A nondeterministic Turing machine M with start state q0 and accepting state qf has the following transition function: Deduce what M does on any input of 0 's and 1 's. Demonstrate your understanding by identifying, from the list below, the ID that CANNOT be reached on some number of moves from the initial ID q 010101. a) qf0111111 b) 0qf111111 c) 0qf11111 d) 01111111q1 6. The Turing machine M has: - States q and p;q is the start state. - Tape symbols 0,1 , and B;0 and 1 are input symbols, and B is the blank. - The following next-move function: Simulate M on the input 1010110, and identify one of the ID's (instantaneous descriptions) of M from the list below. a) 00q00110 b) 001q0110 c) 10101p10 d) 0000q010