Question 1. Given regular languages Li and L2, we know that L(M) U L(M2) is regular also. The proof in class used the fact that every regular language is two DFAs M and M2 a construction for a DFA that recognizes L(Mi) U L(M2). d by a DFA and gave, for any Your task is, using the fact that every regular language is recognized by an NFA, to come up with a alternate proof for "Given regular languages Li and L2, L(Mi) U L(M2) is regular also." You are not permitted the use of DFAs in your argument