3. (25 points) Complete the transition table below for the 3-bit counter at right. Complete the table for all 8 states. Then, assuming the counter starts in the "000" state, complete the state graph. There are states which are not reached when the counter starts at "000". Assume the counter starts in each of those states and further complete the graph. (Hint: First write out the Boolean equations for A, B, C) - use them to complete the table. CLK D QA CLK Q ABC A B C+ 000 001 010 011 100 101 110 111 D CLK 000 111 QB Q 001 101 010 100 110 CLK Q C 011 na