Using Figurebelow. Solve theproblem for the A$.$ Fip Finp D input and select the correct answer. Note fercerdul bodu the AFlipFlop input Des

Design a $3$ bit counter to count the sequence: $110,111,010,001,100$ Use $3^{?}D"$ Flip$-$Flops $(A,B,C)$ where the output is driven directly from the flip$-$flops. Fill in the State Table, Kmaps and FF input equations. Notice, the truth table is in binary order to make it easier to fill in K$-$maps.

$\backslash$table$[[4,$b$,$C$,$Aa$,1,3,6,0],[$D$,1,$D$,,,],[0,1,1,3,x,x$