Problem 10) (15 points) Design a Mealy state machine that will detect a 1010 sequence from an inputs with overlap (e.g. the following stream of bits will cause the sequence to be detected twice: 101010".) Fill in the state table (the starting state is 00 and they are subsequently named in numeral order.) Make sure to use don't cares to fill in the implementation columns, when possible. Once you have the state table, calculate the next state logic for D1 and DO, and output logic for z using K-maps. Finally, draw the state machine circuit. Use D flip-flops for state memory. It may be useful to first construct a state transition diagram but only the state table will be graded. Note that the following page is available to you for additional workspace for this problem. State Table Flip Flop Inputs D1 DOT Present State Input Next State Output | Q1 QOS | Q1* 20* | Z 0 0 0 1 0 1 0 1 0 0 1 / 1 100 | 01 1 1 0 1 1 1 Next State Logic: Output Logic: State Machine Circuit