Question 9 10 pts Select all the statements below which are true: Let M be a nfa. The language L accepted by M consists of all the strings w for which there O If a language L can be represented by a nfa, then we can also compute a dfa for L Let 0,1,2 and go be the initial state of a nfa M. Then the transition graph of M has exists a walk labeled w from the initial state to some final state. a maximum of 3 outgoing edges at go O If a language L can be represented by a dfa or by a nfa, then L is regular. The transition function of a dfa cannot be defined using a transition table. O Let M be a nfa. If the initial state qo is also a final state, then L (M) Let2-[ai, a2,.. ., an}. Let M be a dfa and let GM be the corresponding transition graph. Let m be the number of vertices in GM. Then m n