For each of the following language L_i, provide a formal definition OR a state diagram of a DFA recognizing such language ( = 0,1):

(a) L_a = {w| w is a binary number divisible by 3}

(b) L_b = {w| w is a ternary number divisible by 3}