2. For each of the following language Li, provide a formal definition OR a state diagram of a DFA recognizing such language (=0,1) : (a) La={ww is a binary number divisible by 3} (b) Lb={ww is a ternary number divisible by 3}