(10 points) A moore FSM has a single infinitely long binary string r as input and a single output. The output is a logic 1 if there are two consecutive ls or two consecutive Os received. For example, 2) npu ut 0110001 output 0010110 Design the FSM. Use full encoding. Construct a timing diagram for the input sequence shown above. Be sure and do an implication table check 3) 5 points) Show the schematic of a one-hot encoded FSM that implements problem 2