Consider the following two DFAs M₁ and M₂. In both cases, the start state is q1, the final states are marked with F, and = {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₁) L(M₂).

B)

Construction a DFA, M accepting the intersection L(M) = L(M₁) L(M₂). L(M₁) L(M₂) = {w | w L(M₁) and w L(M₂)}.

C)

TRUE or FALSE: Regular languages are closed under intersection?

1-1-3-4 2344 F2F4 2 1-1-3-4 2344 F2F4 2