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. a. The string contains a number of 1s divisible by three b. Show transcribed image text 10. (10 pt) In part a, construct a finite automaton that determines whether or not a binary input string meets the
OR
OR