Below is a VM diagram that gives candy under some condition. Draw a VM diagram with fewer states that gives candy under the same condition and describe the condition Bives candy under the same condition and describe the eoncuition. For each of the following vending machines, draw a VM diagram that meets the condition and uses the fewes possible number of states. You do not need to explain your diagrams: c. Gives candy if and only if the buyer has entered exactly 15 cents d. Gives candy if and only if the buyer has entered an odd number of nickels and an even number of coins e. Gives candy if and only if some consecutive sequence of coins entered adds up to 20 cents. (For example, DNDDND gives candy because it contains the consecutive sequence DD which adds up to 20 cents).

1. Below is a VM diagram that gives candy under some condition. Draw a VM diagram with fewer
states that gives candy under the same condition and describe the condition Bives candy under
the same condition and describe the eoncuition. For each of the following vending machines,
draw a VM diagram that meets the condition and uses the fewes possible number of states. You
do not need to explain your diagrams: c. Gives candy if and only if the buyer has entered exactly
15 cents d. Gives candy if and only if the buyer has entered an odd number of nickels and an
even number of coins e. Gives candy if and only if some consecutive sequence of coins entered
adds up to 20 cents. (For example, DNDDND gives candy because it contains the consecutive
sequence DD which adds up to 20 cents)