draw a state diagram for the simplest finite automaton that recognizes the language of any number of concatenations of strings in {000,11}