Given the following state diagram, and state encoding, implement the state machine using D flip flops. (a) Fill in the state table including present state, next state, and output information. (b) Fill in Karnaugh maps for the next-state values for each state-holding flip flop, and the output. Circle the terms in the K-map and write the optimized Boolean equations for the next-state functions of each of the state variables and output values Given the following state diagram, and state encoding, implement the state machine using D flip flops. (a) Fill in the state table including present state, next state, and output information. (b) Fill in Karnaugh maps for the next-state values for each state-holding flip flop, and the output. Circle the terms in the K-map and write the optimized Boolean equations for the next-state functions of each of the state variables and output values