Applying state reduction with a minimum number of states on the following state fable results in: \begin{tabular}{c|11|11] Present State & \multicolumn{2}{c}{Next state } & \multicolumn{3}{c}{ Output } & $\mathrm{x}=0$ & $\mathrm{x}=1$ & $\mathrm{x}=0$ & $\mathrm{x}=1$ \hline $\mathrm{a} $ & $\mathrm{d}$ & $\mathrm{b}$ & 0& ON $\mathrm{-b} $ & $\mathrm{e}$ & $\mathrm{a}$ & 0 & 0 $\mathrm{C}$ & $\mathrm{g}$ & $\mathrm{f}$ & 0 & 1 $\mathrm{-d}$ & $\mathrm{a} $ & $\mathrm{d} $ & 1 & 01 $\mathrm{e}$ & $\mathrm{a} $ & $\mathrm{d} $ & 1 & 0 $\mathrm{f}$ & $\mathrm{c}$ & $\mathrm{b}$ & 0 & 0 $\mathrm{-g]$ & $\mathrm{a} $ & $\mathrm{e}$ & 1 & 0 \end{tabular) Select one: a. 4 states a b. 5 states . c. 6 states d. 3 states e. None SE. SD.034