Design deterministic finite automata (DFA) that recognizes each of the below languages a) b) L1 := {w | (w)3 mod 4 0} L2 := {w | (w)3 mod 4 + 0} defined over the alphabet E = {0, 1, 2}. Nota Bene: The strings w are considered to be the ternary (base 3) representations of numbers. Also, mind that the empty string e represents the mumber zero. Below are a few examples to the behavior of the machine that recognizes L1: string base 3 representation base 10 representation mod 4 | machine reaction 03 1203 1203 010 1510 1510 3210 4110 epted rejected rejected pted rejected 120 3 000120 3 1012 10123 00000001112 11123 1 Hint: Design the DFA that accepts the language Li first, and only then construct the machine recognizing L2 just by complementing.