Please answer all parts and show work! Otherwise, don't answer please, thanks in advance!

6. Design a 3-bit multifunction counter which counts the following sequences 1. 2. [000, 001, 010, 011, 100, 101, 110, 111] (straight binary up counter, M-0) [000, 010, 100, 110, 111, 101, 011, 001, 000...] (even up, odd down, M-1) A Mode switch M allows you to select the type of output. The mode can change at any time. Complete the Moore state diagram clearly showing all transitions for both Mode switch positions. Note that the Moore outputs are simply the three present state bits representing the eight states. Fill in all circles and transitions. Complete a state transition table for the machine. Find minimized Boolean expressions for next state inputs D2, D1, DO as a function of Q2, Q1, and Q0. a. b. c. Present State Q2Q1Qo Next State Inputs 1951. D2 DO