Construct a finite-state machine that models an old fashioned soda machine that accepts nickels, dimes, and quarters.

Question:

Construct a finite-state machine that models an old fashioned soda machine that accepts nickels, dimes, and quarters. The soda machine accepts change until 35 cents has been put in. It gives change back for any amount greater than 35 cents. Then the customer can push buttons to receive either a cola, a root beer, or a ginger ale.