Vending Machines: Figure 1 presents a partial DFA that describes the behavior of a vending machine which accepts dollars and quarters, and charges $1.25 per soda. Once the machine receives at least $1.25, corresponding to the blue-colored states in the diagram, it will allow the user to select a soda. Self-loops represent ignored input: the machine will not dispense a soda until at least $1.25 has been deposited, and it will not accept more money once it has already received greater than or equal to $1.25. To express the NFA as a 5-tuple, the components are denoted as follows: 1.Q = {$0.00, $0.25, $0.50, $0.75, $1.00, $1.25, $1.50, $1.75, $2.00} are the states 2. = {$0.25, $1.00, select} is the alphabet 3., the transition function, is partially described by the state diagram 4.q0 = $0.00 is the start state 5.F = is the set of accept states (no accept states. The DFA will go to the initial state after dispense a soda.) Complete the NFA (adding transition functions) based on the requirements. The components 1, 2, 4, and 5 should not be changed. The only part can be changed is 3. Please use JFLAP to complete the NFA. Figure 1 Vending Machine DFA (Partial)

Figure 1 Vending Machine DFA (Partial)