Design a Mealy FSM that implements a candy vending machine where each candy costs 25 cents. The vending machine only accepts dimes (input D) and quarters (input Q), one at a time. The input format is DQ. If both a D and a Q are entered, the state machine does not advance, that is, it stays 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 machine will return some change (output C). Output C will be raised High regardless of how much change is required (assume some other FSM deals with the return of the change). Use state names and assignments following the usual sequences (i.e. S0, S1, etc., and 00...00,00..01, etc., respectively). Use the minimum number of bits required for state assignments. Use don't cares If necessary. Obtain the state transition diagram, state transition table, state assignment table, output table, next-state equations, and output equations for this FSM. Simplify the equations as much as possible, use Boolean algebra theorems and axioms to perform the simplifications (alternatively, you could use a 5-variable K -map, but this would be more involved than material