1. (Conversion procedures Use asymptotic (big-0) notation to answer the following ques- tions. Provide brief explanations. (a) Let N be an NFA that has n states. If we convert N to an equivalent DFA M using the procedure we described, how many states would M have? (b) Let M be a DFA that has n states. If we convert M to an equivalent regular expression R using the procedure we described, how many symbols would R have in the worst case? 1. (Conversion procedures Use asymptotic (big-0) notation to answer the following ques- tions. Provide brief explanations. (a) Let N be an NFA that has n states. If we convert N to an equivalent DFA M using the procedure we described, how many states would M have? (b) Let M be a DFA that has n states. If we convert M to an equivalent regular expression R using the procedure we described, how many symbols would R have in the worst case