$1.$ Construct a Moore machine that takes binary numbers as an input. Then in every input binary number, it counts the number of substrings $\text{'}0011\text{'}.$ See example input and output below:

Examples

Show the following:

$-$ Draw a state diagram

$-$ Needed tuples: $\backslash ($ M$=\backslash \{$Q$,\backslash$Sigma$,$ q $0,\backslash$Delta$\backslash \}\backslash )$

$2.$ Construct a Mealy machine that takes a binary number as an input. Then in every input binary number, it replaces the first $1$ with a $0$ from every substring starting with $1.$ See example input and output below:

Examples

Show the following:

$-$ Draw a state diagram

$-$ Needed tuples: $\backslash ($ M$=\backslash$left$\backslash \{$Q$,\backslash$sum$,$ q $0,\backslash$Delta$\backslash$right$\backslash \}\backslash )$

$3.$ In connection to $\backslash$#$2,$ convert that mealy machine to moore machine. Please provide an accurate and proof of conversion.