Suppose we have a machine that takes in an infinite stream of bits, one bit at a time. On every input, the machine will output 'O', unless the machine has seen the pattern '10101' in the last five inputs where it will instead output '1'. Below is an example of this behavior. Input: 010101001110110101011... Output: 000001000000000001000

Design a circuit that exhibits the behavior described above, use D-Flip-Flops for memory, and use an encoded state (i. e., fewer flip-flops) design for the state registers. You can also use decoders, encoders, multiplexors, and gates discussed in class. (20 Points)