Create the following code in C using this finite state machine diagram
finite-snare meacae (FS is an ahstract model ofa system (plhysical, hialogical, mechanical, electronic, oe software). Key components ane a rie number of nares which represent the internal "memory" of the system by implicitly storing information about what has happened before state of the machine swellas the ceinput and often result in a change of state. rransitions which represent the 'response" of the system to its enviroment Transitions depend upon the cw micc1, d dise, q quarter, sclect soda Consider, tor example, the use of an FSM to model an old time soda machne that dispenses soda for 30 cents. The possible inputs to the machine are or more cents are co su ere ra state an art e s ateso:the m ac une are desagna ed b crcles, each abe ed wath uat of money at as been e osted so ar a e as des gnated as the sa or int designsted by double cucles. The transtons fctate to state a sbown as cs nes with ows Each transition as labeled with the input that caused it. state b e u c u n g u row. States w uchrepresent a tota u pu o 101520 25 05 30 35 40 45 50 The first diagram is that of a candy machine that offers a candy choice for amounts of 30. 35. 40. 45 and 50 cents. Using the diagram, attempt to write a Clanguage program that repeatedly takes inputs from the user and processes them as inputs to the FSM The input may be any of the values shown on transitions HINT: If you find yourself doing addition or subtraction at any time, you're doing this assignment wrong An example of possible IO is given below Welcome to theCandy Machine! Running, state is 0 Input: d Running, state is 10 Input: q Running, state is 35 Input: q Invalid input Running, state is 35 Input: n Invalid input Running, state is 35 Input: s Dispensing Soda Running, state is 0 Input: finite-snare meacae (FS is an ahstract model ofa system (plhysical, hialogical, mechanical, electronic, oe software). Key components ane a rie number of nares which represent the internal "memory" of the system by implicitly storing information about what has happened before state of the machine swellas the ceinput and often result in a change of state. rransitions which represent the 'response" of the system to its enviroment Transitions depend upon the cw micc1, d dise, q quarter, sclect soda Consider, tor example, the use of an FSM to model an old time soda machne that dispenses soda for 30 cents. The possible inputs to the machine are or more cents are co su ere ra state an art e s ateso:the m ac une are desagna ed b crcles, each abe ed wath uat of money at as been e osted so ar a e as des gnated as the sa or int designsted by double cucles. The transtons fctate to state a sbown as cs nes with ows Each transition as labeled with the input that caused it. state b e u c u n g u row. States w uchrepresent a tota u pu o 101520 25 05 30 35 40 45 50 The first diagram is that of a candy machine that offers a candy choice for amounts of 30. 35. 40. 45 and 50 cents. Using the diagram, attempt to write a Clanguage program that repeatedly takes inputs from the user and processes them as inputs to the FSM The input may be any of the values shown on transitions HINT: If you find yourself doing addition or subtraction at any time, you're doing this assignment wrong An example of possible IO is given below Welcome to theCandy Machine! Running, state is 0 Input: d Running, state is 10 Input: q Running, state is 35 Input: q Invalid input Running, state is 35 Input: n Invalid input Running, state is 35 Input: s Dispensing Soda Running, state is 0 Input
