Using J K flip-flops, design a Mealy machine that will detect the sequence 1001. For example: Inputs: 11100110100100110... Outputs:00000100000100100.... Notice the overlapping occurrence of the pattern and account for it in your design. (Hint: assume your initial state is zero or zeros, then you can check the input sequence bit by bit, i.e., check if the 1" bit is matched or not, then check if the 2nd bit is matched or not, then check the 31" bit, then next, and continue. Don't forget to account for the overlapping occurrence.) How many inputs, outputs, and states do you need? Draw the state diagram. How many JK flip-flops do you need? Develop a state table (including the output) (label with a letter for each column clearly). Use K-Maps to simplify the logic expressions. Draw the logic diagram. E. F. G. H