3) (20 pts) A pattern matching circuit accepts an arbitrary length binary sequence A and outputs 1 (X) every time it detects a certain pattern. Sequence A is a binary sequence representing symbols {a,b,c}. 00: represents a 01: represents b 10: represents c At every clock cycle, this circuit accepts a 2-bit symbol from this sequence. This circuit outputs a 1 every time it detects the symbol sequence abc. Draw the state diagram of your circuit (15 points). Translate your state diagram to a state table and see if you can optimize your state table