Draw a Moore Machine to "count" the occurrences of the substrings aab or baa in words over the

alphabet $=\{a,b\}.$ As discussed in Module $2,$ Finite Automata with Output, simply output a $1$

at the end position of the desired substrings from the input string. For example, the input string

aaababaabab would output $000010001100.$