Question

Image text transcribed for accessibility: (Vending Machine Design Example) You are to design a vending machine. The vending machine accepts nickels and dimes only and only contains one product gum that costs $0.15. Since the machine takes only nickels and dimes, it has two inputs (N and D). The machine can either dispense nothing, dispense gum, or dispense gum and $0.05 change. Design the vending machine using J-K flip-flops. The state table present has already been minimized. Use the given state assignment to facilitate grading. Rather than drawing the schematic of the circuit, please show each output in little m notation along with the minimized Boolean equation found using KMAPS. The block diagram of the vending machine is shown in Figure 1. The resulting state table after state minimization is shown in Table 1. You must use the state assignment provided. Fill in the encoded state transition table shown in Table 3. Use the excitation tables for J-K flip-flops to complete the excitation table for the vending machine shown in Table 4. Block Diagram Figure 1: Block Diagram for the Simple Vending Machine. Table 1: Reduced State Table for the Simple Vending Machine. Table 2: State Assignment for the Simple Vending Machine. Table 3: Encoded State Table for the Simple Vending Machine. Excitation Table for the Simple Vending Machine using J-K flip-flops. For each output, use little m notation and then on the next line, write the minimized equation found after using KMAPs for minimization. You do not have to draw the circuit.