Solve BOTH #1 and #2 using logicaid and paper.

1. Use D-flip-flops to design the counter that counts the following sequence and draw the circuit using any drawing software. You will have to use K map to find the minimal expressions for the next state variables 011 110 001 100 010 101 2. Redo #1 using the Logic Aid. To design a counter using the Logic you will have to use the state table as follows i. Select the State Table from the menu Input ii. Select 1 for the number of columns of next state, 0 or 1 for the number inputs and 0 or 1 for the number of outputs, and 1 for the length of the state names iii. Select Mealy Machine. Select the default for other options iv. Label each bit combination with a letter as follows A for 000 B for 001 C for 010, and so forth. You may fellow he same procedure for more than 3 bits Then, construct the transition table according to the given counting sequence v. Convert the transition table into a state table using the letters Now enter the state tableLeave a space between the PS and the NS and enter any value for the output. vi. Select State Assignme of state variables( you need three bits if you have 8 states, and so forth) and do not change the other options. The software will assign a bit combination to every state using the straight binary order nt from the Routine menu and enter the appropriate number vii. Select Flip-Flops Equations from the Routine menu and then select D-flip-flops and Maximum 5 minimum for the equations