Make a finite state machine diagram for the following problem:

please include a truth table or logic design.

Problem #2: Soda dispenser-A soda machine that dispenses sodas for 30 cents (the good old days). The input to the soda machine are 'n'-nickel, 'd' - dime and 'q' - quarter. The states can be labeled with the amount of money accumulated and the starting state can be labeled 00 as a reset state with no money entered. Assume you can dispense the soda at 30 or above, and no need to design the change coins