Question 5A (20 points) FSM below represents a simple vending machine. N is asserted for one clock period when a nickel is inserted into the coin slot. D is asserted when a dime has been deposited. The machine asserts Open for one clock period when 15 cents (or more) has been deposited since the last reset. Let us enumerate all the possible input sequences that lead to releasing the gum: - Three nickels in sequence: N,N,N - Two nickels followed by a dime: N, N, D - A nickel followed by a dime: N, D - A dime followed by a nickel: D, N Two dimes in sequence: D, D The FSM is shown below. Using the state transition table Karnough maps, derive logic for this FSM and implement the circuit