2. (15 points) Deterministic Finite Automata (DFA) / Finite State Machines (a) (5 points) Define the following Deterministic Finite Automata (DFA) as a 5 tuple (Q, , , qs, F) Note: Write 5 in form of transition tabile 41 start9o 42 43 Select the correct answer: Determine which language is accepted by the above DFA? O L-( w I w is a binary string which has alternate 0s and 1s } OL w w is a binary string which has same number of Os and 1s L-{ w I w is a binary string which has even number of 0s and even number of 1s } (b) (10 points) Give a state diagram for the following statement: Ternary Integers: L = {w E {0, 1,2)" : w is a ternary representation of an integer that is a multiple of 3 but not a multiple of 9)