10. (10 pt) In part a, construct a finite automaton that determines whether or not a binary input string meets the given condition. In part b, interpret the state diagram to describe the set recognized by the automaton. The string contains a number of 1s divisible by three. a. b. 11. (6 pt) Construct either a state table or diagram for a finite automation that determines whether or not a binary input string meets each
OR
OR