$5.)$ Design a string recognizer whose output will be true if the last four input values seen are $"1100"$ or $"1010",$ including the current one. For this circuit $($a$)$ Draw the state diagram and $($b$)$ implement it with D flip$-$flops

$6.)$ Create an implementation of the following finite state machine. You can use any basic gates, and D flipflops.