{0,1}: Consider the following DFA (M1) over the alphabet E = State diagram for a DFA 1 1 1 93 q2 M1 Grafstate" TH Consider the following DFA (M2) over the alphabet E = {0,1}: State diagram for a DFA 1...

Consider the following DFAs:

a) Create a DFA that recognizes L(M₁) ∩ L(M₂).

b) Create a DFA that recognizes L(M₁) ∪ L(M₂).

b) How does the DFA from (a) differ from the DFA from (b)?

Extracted text: {0,1}: Consider the following DFA (M1) over the alphabet E = State diagram for a DFA 1 1 1 93 q2 M1 Grafstate" TH Consider the following DFA (M2) over the alphabet E = {0,1}: State diagram for a DFA 1 1 r2 ri 1 r3