Using this table and Karnaugh maps, derive and minimize the input equations for a counter composed of three M$-$N flip$-$flops which counts in the following sequence:

CBA $=000,001,011,111,101,100,($repeat$)000,$