3. 21) Draw the complete Moore Model state diagram for a sequence recognizer with input x which is a serial input of 1's and 0's. It has 1 output z. z = 1 iff the last 3 digits on the input are 1 0 1 AND must NOT overlap a previously recognized sequence . A sample input loutput might look like this: (5) X 0 01010111011010... Z 0 0 1 0 1000100010010... b) Draw the corresponding Moore state table for the state diagram in part a). (5) c) For an arbitrary state machine with 19 states , what is the fewest # of JK flip flops needed to implement it? (4)