4. Variation on 13.2# Construct a finite-state machine that models an old- fashioned soda machine that accepts nickels, dimes, and quarters. The soda machine accepts change until 45 cents has been put in. It gives change back for any amount greater than 45 cents. Then the customer can push buttons to receive either a cola, a root beer, or a ginger ale. You may represent it either with a state diagram or a state table. [10 points]