Design a finite state machine with one input I, and two outputs Z and E. The machine should produce a Z output whenever it has seen a 110 pattern on the input stream, except that if it ever sees a 001 pattern on the input stream, it should assert the E output, and keep that E output asserted until the machine is reset. Note that Z should never be asserted again once E is asserted. Design a state machine to implement this function. Don’t implement the circuit, just draw the state diagram for a Moore-style state machine (i.e. outputs are determined only by which state you’re in).