1. The University of California engineering student chapter is co-sponsoring a tea vending machine with a heavily subsidized price of 30 cents a cup. Design a Moore FSM for the vending machine assuming the students can only load nickels [5 cents] (input N), only one coin at a time. If the user enters no coins at all, the vending machine will stay in the same state. The vending machine will dispense the product (output P will be pulled High) as soon as there is enough money entered and then reset. Use active-high logic to indicate an input or output is active. Show the state transition diagram, state assignment table, state transition table, next-state equations, and output equations. Use K-maps to extract the most simplified equations. For any unused binary state assignments, set the next state to Reset and output to zero.

2. Design the FSM above as a Mealy FSM.