$5.$ Draw a Moore machine and a Mealy machine that reads a sequence of binary digits of arbitrary length, and detects whether the latest $3$ input digits are $\text{'}101\text{'}.$ If it is true, output $1$ ; otherwise, output $0.$ When the number of input digits is less than $3,$ output $0.$ Assume the Moore machine will not generate an output at the initial state before reading the input.

Example:

Input: $010110101$

Output: $000100101$