The objective of this homework is to build a coin counter for a vending machine. The vending machine counts coins in any combination up to 25 cents. 1) Draw a state diagram, you should have states for each amount of coinage so far, that is 0, 5, 10, 15, 20 and 25 cent states. Only one coin can be put in at a time, either quarter dime or nickel. Make each of these an input, Quarter, Dime, and Nickel. Calculate output Z=1 when you get to 25 cents, otherwise Z=0. Some combinations will take you to more than 25 cents you can create an overflow state to handle that circumstance, maybe call it OF. 2) Assign state numbers to be implemented in flipflops for each state representing 0,5,10,15,20 and 25 cents, and your overflow state. 3) Using this state assignment create a state table. 4) Using the data from the state table create a truth table for Q2*, Q*, Qo*, and Z. 5) Using Karnaugh maps or Boolean Algebra find Q2*, Q*, and Qo*, and Z. 6) Implement this Q2*=D2, Q1*=D, and Qo*=Do, using D flipflops and digital logic. Also use digital logic to create output Z.