1) (5 points) See that attached Mealy FSM state table. Use implication tables to see if it can be reduced. If so, give the reduced state table. Just to make the grading easier, pick the "lesser character" to keep and consider the others redundant states. For example, suppose (H, E) and (C, B, K) are equivalent. Then keep 'E' because it comes before 'H' in the alphabet. Similarly keep 'B' and discard the others. 2) (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 1s or two consecutive Os received. For example, input 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