Present a transition diagram for a DFA that recognizes the set of binary strings that, when interpreted as entering the DFA most to least significant...

Present a transition diagram for a DFA that recognizes the set of binary strings that, when interpreted as entering the DFA most to least significant digit, each represents a binary number that is divisible by either 2 or 3 or both. Thus, 100, 110, 1001 and 1100 are in the language, but 01, 101, 111 and 1011 are not.