Assume a Pattern recognizer has the following specifications:

a$)$ A single input and a single output

b$)$ The output is I if and only if the input has completed the sequence $11$ or $1101.$

c$)$ OVERLAP is NOT ALLOWED. Remember: No overlap means that if the pattern is broken by the next input, return to the beginning and start over again. $(25$ points$).$

USE T flip$-$flops

Show the STATE DIAGRAM $(5$ points$)$

Show the STATE TRANSITION TABLE $(10$ points$)$

But present the SIMPLIFIED VERSIONS of the BOOLEAN expressions for the INPUTS TO THE FLIP$-$FLOPS and the OUTPUT of the circuit. $(10$ points$)$

Do NOT DRAW the circuit: