Use state reduction to minimize the following state table to the minimum number of states. Give the

reduced state table.

$($When removing states, remove the state with the highest letter or number. e$.$g$.$ Remove $\text{'}$e$\text{'}$ instead of

$\text{'}$b$\text{'}.$ Remove $\text{'}101\text{'}$ instead of $\text{'}010\text{'}.)$

$1----------------------------1$

$|$ Pres$|$ Next State$|$ Output $|$

$|$State $|x=0,|x=1,|x=0,|x=1,|$

$|000|101|100|1||0|$

$|001|010|000|1|1|1|$

$|011|000|011|010101$

$|100|111|100|1||0|$

$|110|111|101|0|0|$

$|111|111|011|1|100|$

$|--------------------------------$