Question $6$

In the state machine for the last two questions, which of the following State Variable binary code

transitions below are the only that experience a don't care input condition given that that binary

code is based in order of the segments alphabetically?

Note to be sure and take into account that any segments grouped together would use the first

shared letter for alphabetical ordering.

$112100011$ to $102020101$

$110110001$ to $110000101$

$100110100$ to $110101011$

$011000101$ to $110101010$

$101100010$ to $001010001$

none of these binary pattern transitions codes

$111200102$ to $120001021$

$001110001$ to $111101111$

$101100010$ to $000111100$

$110110100$ to $101101001$

$001010001$ to $111110100$

$101001001$ to $001111000$

$111110100$ to $000111100$