Problem #6: Moore Sequential Network Analysis A Moore sequential network using J-K flip-flops and logic gates has P as its input and Q as its output such that Q sets to 1 only when the total number of 1's appearing sequentially at P is divisible by 4. Therefore, the network provides Q-1 if at an instance the total number of 1's at P is 0, 4, 8, 12, Fcr all other values of input l 's, Q =0. Write the values of Q when P receives the following string of binary bits: 00101110100101110011010. Draw the state diagram, the state table, transition table, the next state maps for the flip-flops and finally the logic diagram of your design of the Moore FSM