PLEASE SUBMIT THE SOLUTION OF PROBLEMS 1-4 and SOLUTION OF CHALLENGE PROBLEM AND CLASS PROBLEM SEPARATELY.YOU WILL DEPOSIT YOUR SOLUTIONS IN TWO PILES. REGULAR PILE FOR PROBLEMS 1-4.
ON THE OTHER SIDE OF SINK PUT SOLUTION FOR THE OTHER TWO PROBLEMS.1. Design a state machine that will read in sequence of binary digits, one at a time, and will light a lamp if the sequence contains an odd number of 1s.
2. Design a state machine that will read in sequence of binary digits, one at a time, and will light a lamp at any point when the number of 1s read in is divisible by three.
3. Design a state machine that will read in sequence of binary digits, one at a time, and will stop when it has read in five 1s.
4. Give a state diagram for a state machine that will read in sequence of binary digits, one at a time, and will stop when at least three consecutive 1s followed by a 0 have been read in. To "stop" the machine, merely have it orbit in the state it reaches after a successful match.
5. Challenge Problem: Design a state machine that will read in a sequence of binary digits, one at a time, and will light a lamp if the decimal value represented by the sequence is divisible by 3. Assume reading is to start with the leftmost digit.
6. Complex Wending machine. Provide a state transition diagram for the complex machine problem described in class with definition of your inputs, outputs, states, and state assignment.