Solve this question with diagram $($draw$).$ Construct a Moore machine and a Mealy machine which recognize

strings over the alphabet $\{a,b,c\}$ and output $1$ if the string contains the substring

"abc", and $0$ otherwise. For example, the input "abbcabacba" outputs $0,$ while the

input "ababaababc" outputs $1.$