Question 1: Draw a state diagram for a finite state machine that outputs 1 when a binary number with an odd number of 1's is read. For example, for the input "001110111," your machine should output "001011010."
Question 2: How many flip-flops are needed to implement the FSM designed in part a?
Can you implement the FSM and also draw the state diagram?