Design a 2-bit fsm that counts up, down, and cycles through 2 sets of gray code. the 2-bit input will be called x. the 'output' is the output of the ff's (aka q_1q_0). use jk-ff's. here is how it will operate: a. x=00: 00 -> 01 -> 10 -> 11 -> . x=01: 00 -> 01 -> 11 -> 10 -> . x=10: 00 -> 11 -> 10 -> 01 -> . x=11: 00 -> 10 -> 11 -> 01 ->

x+2 because it just doubles hon so the pattern can actually tell you the expression.

so for example,

if x=2 then 2+2 is 4

if x=4 then 4+4 is 8

and so on and so forth.

i really hope that this makes sense and you out in a way hon: )

answer:

try looking it up that is always

explanation:

answer:

my guess it 8 i'm probably wrong

answer:

a

explanation:

it a unlucky day