1) Design a Mealy FSM that implements a candy vending machine where each candy costs 25cents. The vending machine only accepts dimes (input D) and quarters (input Q), one at a time. Theinput format is DQ. If both a D and a Q are entered, the state machine does not advance, that is, itstays in the same state. Once 25 cents or more is entered, the vending machine will output a product(output P) and go to the Reset state. If the user enters more than 25 cents total, the vending machinewill return some change (output C). Output C will be raised High regardless of how much change isrequired (assume some other FSM deals with the return of the change). Use state names andassignments following the usual sequences (i.e. S0, S1, etc, and 0000, 00..01, etc, respectively). Usethe minimum number of bits required for state assignments. Use dont cares if necessary. Obtain thestate transition diagram, state transition table, state assignment table, output table, next-stateequations, and output equations for this FSM. Simplify the equations as much as possible, use Booleanalgebra theorems and axioms to perform the simplifications or a 4-variable K-map if it fits the numberof states you have. Alternatively, you could use a 5- or more-variable K-map if the question needs it, but this would be more involved than material covered in class.

2) Implement the vending machine above using a Moore FSM.

3) Implement a Mealy FSM to detect the 1100110 sequence with overlap. The output Yshould be a 1 only when the sequence has been detected and 0 otherwise. Obtain the statetransition diagram, state transition table, state assignment table, output table, next-state equations,and output equations for this FSM. Use SR flip-flops for state storage. Simplify the equations as much aspossible using a K-map. Use dont cares as necessary.