Design a Mealy Finite State Machine, which will recognize the sequence $"101"$ or $"110"$ without reset. Your design should be able to recognize either of the sequences, not just one. Once one of the sequences is recognized, an output should go high indicating one of the sequences has been found. The circuit should be a minimum $2-$level SOP gate implementation that is driving D flip$-$flops. The implementation should have as few states as possible. Show the state diagram $(10pts.),$ and the final circuit design $(10pts.).$ Also show any pertinent work.

$\backslash$table$[[$Present State Input,Next State,Flip$-$Flops Output$],[$A$,$B$,$I,A$+,$B$+,$DA$,$D$,$O$],[,,,,,,,],[,,,,,,,],[,,,,,,,],],[,$PLEASE DRAW EVERYTHING ON PAPER SO I CAN SEE THE STEPS