(10 points) Consider the following state table
State X=0 X=1 Output
SO S3 S1 0
S1 S3 S1 0
S2 S1 S5 0
S3 S2 S6 0
S4 S5 S4 1
S5 S3 S2 1
S6 S3 S4 0
Table 1: Caption
(a) Using the above state table, group the states by the three assignment guidelines given in the slides
(b) Using the assignment groupings in part a, create a 3-bit state assignment map and determine optimal state assignments. How many groupings can be satisfied? How many cannot?