Design two types of $4-$bit sequence detectors $($one Sliding window non$-$overlapping Type and Sliding window non$-$overlapping Type$)$ as shown in section $14,1$ of your textbook, using D flip$-$flops, to detect the following sequence: $1101.$ Provide all $($a$)$ through $($h$)$ steps necessary to design and verify your finite state machine. Consult Guidelines $1-7,$ in section $14\mathrm{.}3$ in your textbook as well. Is it a Mealy or a Moore Machine? Give State Graph for both a Moore Machine and a Mealy Machine version.

$($a$)$ State diagram $($each state named and then designated by binary number,

$($b$)$ State whether this is a Mealy Machine or Moore Machine

$($c$)$ Next$-$state Tables, $($columns: Present State, Next State, Inputs, Outputs$).$

$($d$)$ Flip$-$flop transition tables $($for flip$-$flop chosen$).$

$($e$)$ Circuit excitation tables,

$($f$)$ Karnaugh maps and Logic Equations for flip$-$flop inputs

$($g$)$ Logic circuit implementation and circuit diagram. Verification.

$($h$)$ Go back and write input and output $(0$ or $1)$ on the arrows or the circles as appropriate.