Computational theory. I will give thumbs up

Q. 6 Maximum score 20 Design a Mealy machine for a 20 cent candy dispensing machine which accepts nickel (n), dime (d) and quarter(q). It gives candy as well change in the form of nickels only. To help you, here are the some of the elements of the machine: States: 0, 5, 10 and 15 represent the amount of money already inserted in the machine. n, d and q representing coins inserted in the machine Output: c 0(candy and no change), ci (one nickel as change), c2(two nickels as change), C3 (three nickels as change), and c4 (four nickels as change)