QUESTION 6 What is the language of the NFA below. 1, {0190' | P20,920,r20} {OP10'| P20,952, r20} (OP110'| P20,r20) None of the above QUESTION 7 Consider the NFA from the problem #6. Suppose that M is an equivalent DFA built using the procedure presented in class. Which of the following represents the start state of M? {a} {a,b} {a,b,c} O None of the above QUESTION 8 Consider the NFA from the problem #6 again. Suppose that M is an equivalent DFA built using the procedure presented in class. Suppose that your automaton M is in the state {a,c} and reads the alphabet symbol O. What will be the next state of the automaton M? {a} {a.c) {a,b) {a,b,c} QUESTION 9 Suppose that your DFA M (mentioned in the above problem) is in the state o. After reading the input symbol 1, M will be in which of the following states? O 8) {a} None of the above QUESTION 10 Suppose now that your DFA M (mentioned in the above problem) is in the state (b). After reading the input symbol O, M will be in which of the following states? {b} {b,c} None of the above