(10)Problem 1: Flipop implementation a. Show how to implement a T ip-op starting with a J-K ip-flop b. Show how to implement a T ip-op starting with a D ip-flop c. Show how to implement a D ip-op starting with a J-K ip-flop (15)Problem 2: Draw a Mealy state diagram for a machine that has 1 input line(X) and 2 output lines (21 and 22). An output 21 = 1 occurs every time the input sequence 101 is observed, provided the sequence 011 has never been seen. An output 22 = 1 occurs every time the input sequence 011 is observed. Note that once 22 = 1, 21 can never become 1. You do not need to implement this machine. Just draw the state diagram. (25)Problem 3: A sequential circuit has one input (X) and one output (2). Design a Mealy machine with reset for the following case. The output is 2:1 if and only if the total number of ls received is divisible by 4. (e.g. 0, 4, 8...) Use one-hot state assignment. i) Draw the state diagram and the state transition table. ii) Implement the circuit using DFFs and other necessary combinational logic components (25)Problem 4: Design a sequential circuit with two inputs, E and X. If E=0, the circuit remains in the same state regardless of the value of X. When E=1 and x=1, the circuit goes through the state transitions from 00 to 01 to 10 to 11 back to 00, and repeats. When E=1 and x=0, the circuit goes through the state transitions from 00 to 11 to 10 to 01 back to 00, and repeats. After reset, the circuit goes into state 00. Assume that X can only change when the circuit is in state 00. i) Draw the state diagram and the state transition table. ii) Implement the circuit using DFFs and other necessary combinational logic components (25)Problem 5: Given the state diagram on the next page and the state assignment 80:000, 51: 001, $2: 010, 53:011, 84: 100, SS: 101. i) Write down the state transition table ii) Derive the minimized Boolean equations for implementing the next state and output functions iii) Design the equivalent circuit using Moore machine. Draw the new state diagram and the state transition table. You do not need to implement it