Deterministic finite automaton Alphabet = {a, b). Define a deterministic finite automaton (DFA) M that 1. recognizes the language A fa) 2, recognizes the language B = {e,a, b} 3. recognizes the language C = {x E * I #a(z) mod 3-1 } 4, recognizes the language D = L(a) where a is a regular expression: (a + b)*aba 5, recognizes the language E = D 6, recognizes F = {x E 01 x starts with a b ends with an a} 7, recognizes the language G = L(3) where is a regular expression: (a* + b*)aba (a + b)*