FSM (5 pts.): Draw the state diagram of a Mealy machine which accepts a binary stream and outputs a ' 1 ' whenever it detects a pattern "111". Overlapping sequences are allowed. For example: Perform binary state encoding. Show the tabular representations of next state and output functions. Derive minimized Boolean equations for next state and output functions using K-maps. You do not need to draw your circuit