#8 Convert the following FSM to the nearest Moore FSM equivalent. Hint: it may help to describe what the FSM does as an intermediate step, not by state name, but by what outputs result from changes in input. Start Tu=0,y=0 SO s=0 y=1 lua1 y=0 $1 Inputs: s.r. Outputs: u. r/u=0 y=0 r/m1 y=1 S2 s/u=1 y=1 #EC Reduce the number of state in the following FSM using the implication table method. Inputs: i; Outputs: h=1 h=0 h=0 B h=1 Dh=0 h=0