Consider an infinite sequence of binary bits: a. Draw the state diagram for a Mealy machine that reads the infinite sequence of bits and produces 1 in the output if the last four bits that the machine has read are 1100; otherwise the output is 0. You can use maximum of 4 states in your diagram. b. Build the state table for the Mealy machine drawn in (a). c. Implement the sequential circuit of the Mealy machine drawn in (a)using two D Flip-Flops and any other needed logical gates.

Fig: 1

Fig: 2

Fig: 3

Fig: 4