Consider a coin-operated vending machine. Assume that the machine accepts only quarters, dimes, and nickels. Coins are inserted until a total of 30 cents or more is deposited. x1= quarter, x2= dime, x3= nickel. Only one coin is deposited at a time. The output signal z1=1 should indicate that merchandise should be provided; z1=0 indicates no merchandise. Coincident with the last coin input, the (change) outputs are to be set. Assume the machine can give a dime (z2=1) and/or a nickel (z3=1). Use the binary outputs z2 and z3 to represent the 4 distinct possibilities(No change, 1 nickel, 1 dime, 1 nickel and 1 dime.) If a customer doessomething unwise, like puts in a quarter followed by a quarter, correct change does not have to be provided (but the maximum amount change does.) Because each flip-flop (and output if you use a Mealy machine) is dependent on the flip-flops and the input variables, a K-Map is virtually impossible. The Quine-McCloskey method does yield some simplifications. Notice that since only one input can be high at a time, you don%u2019t need to test for low on the other two inputs in your AND gates.