Let R be a RRG constructed from a DFA D as in the construction given in the notes section entitled "Equivalence of RGs and NFAs". Suppose D has n states, m accept states, and k input alphabet symbols. How many rules does R have? (Note that many rules can be written on one line; for instance ABCDx represents 3 rules. nk+m nm nk+nm n+m Consider the following EA: Which of the following is an equivalent regex? (0110) (010(0110)111)) 010(0110)111 010(0110)111 Let R be the regex (ab)(bc)a An equivalent NFA is Consider the following NFA: Which of the following EA (expression automata) would be obtained from the construction in the lecture notes showing how to remove the state i to obtain an equivalent EA