$[25$ pts$]$ Design a counter with three $T$ flip$-$flops that goes through the following binary

repeated sequence: $000001011111110100$ treating transition out of

other states as don't cares. $[15$ pts$]$

Based on this design, what happens when the counter enters the binary states $010$ and

$101$ accidentally? $5pts$

Propose a method so that the counter will return to its normal operation even if it

enters $010$ or $101$ accidentally. $[5$ pts$]$