3. Given the following state table, try to do the state assignment according to the 15.8 guidelines and draw the K-Map. (Based on three guidelines, try to write the sets for the adjacency list.) Present State S S S S; S S Next State Output X=0 1 X=0 X= 1 SS 0 0 SS. 0 0 S, S 1 0 SS, 0 0 S, S. 0 0 SS 0 1 15.8 Guidelines for State Assignment Trying all nonequivalent state assignments is not practical in most cases. The following guidelines are useful in making assignments which will place 1's together (or O's together) on the next-state maps: 1. States which have the same next state for a given input should be given adjacent assignments. 2. States which are the next states of the same state should be given adjacent assignments. 3. States which have the same output for a given input should be given adjacent assignments. Guideline 3 will place 1's together on the output maps