Consider the following two DFAs M_1 and M_2. In both cases, the start state is q1, the final states are marked with F, and sigma = {a, b}. a. Using the method given in the proof of Theorem 1.25 (stating on page 45), construction a DFA, M accepting the union, so L(M) = L(M_1) Union L(M_2). b. Construction a DFA, M' accepting the intersection L(M) = L(M_1) Intersection L(M_2). L(M_1) Intersection L(M_2) = {w | w elementof L(M_1) and w elementof L(M_2)}. c. TRUE or FALSE: Regular languages are closed under inter