In the vending machine example used in Section A.13.4 to illustrate the finite state machine model, a single binary output, z, was used to indicate the dispensing of mer- chandise. Change was not provided as an output. The purpose of this problem is to expand the output to include providing proper change. Assume that the only input sequences of dimes and quarters are: 10-10-10, 10-25, 25-10, and 25-25. Coincident with the last coin input, the outputs to be provided for these sequences are 0, 5, 5, and 20, respectively. Use two new binary outputs, 22 and 23, to represent the three distinct outputs. (This does not correspond directly to coins in use, but it keeps the problem simple.)

(a) Specify the new state table that incorporates the new outputs.

(b) Develop the logic expressions for the new outputs z2 and 23.

(c) Are there any equivalent states in the new state table?

LO1