Question 9 Not yet answered Consider the following automata, where char is (a, b, .} and digit is {0, 1, 2... 9). One of the reasons for the automata to be NFA reasons is digit char Marked out of 2.00 P Flag question char q1 digit q3 90 char & 42 O a. Turing Machine O b. The transitions out of q0 are not complete O C. The transition 91 --> q3 is not deterministic O d. The transitions q2 --> 93 are not deterministic