Draw the state diagram of a finite automation that accepts the language of all strings over {0,1} that represent binary numbers that are divisible by 3. For example, the language contains the string 101010 and 00011, because 42 and 3 are divisible by 3. Leading 0s are allowed, and the empty string should also be accepted. Your finite automation should not be overly complicated.