3. a) 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 101 AND must NOT overlap a previously sequence A sample input output might look like this: (5) recognized X = 0 1 0101 0111 01101 0... Z = 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 0... b) Draw the corresponding Moore state table for the state diagram in part a). (5) c) For an arbitrary state machine JK flip flops needed to implement with 19 states, what is the fewest # of it? (4)