Select all the statements below which are true: If a language L can be represented by a nfa, then we can also compute a dfa for L. The transition function of a dfa cannot be defined using a transition table. O Let {al, aa . . , 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 2n. Let M be a nfa. The language L accepted by M consists of all the strings w for which there exists a walk labeled w from the initial state to some final state. Let M be a na. If the initial state qo is also a final state, then e L (M) O Let = {0, 1,2} and go be the initial state of a na M. Then the transition graph of M has a maximum of 3 outgoing edges at go If a language L can be represented by a dfa or by a nfa, then L is regular