(b) You are to design a finite state machine that realizes the above state transition diagram/state transition with D flip flops. Below, fill in the K-maps for D(A), D(B) and Z (see figure on next...

Okay I just asked thus question and it was answered correctly. DO NOT TRY TO CHANGE THE K-MAPS ANSWER. My question has nothing to do with assigned homework. I just need to know how to implement a finite state machine based off of the K-Maps provided. Again, to don't draw a truth table or do other k-maps. please implement a gate design for THESE functions related to a finite state machine. thank you!

Extracted text: (b) You are to design a finite state machine that realizes the above state transition diagram/state transition with D flip flops. Below, fill in the K-maps for D(A), D(B) and Z (see figure on next page) and write the miminal Boolean expressions for the same, DIH) = FB I+ ATBI+ ĀBI4ABI Ā CBZ +BI)+AĒI +B=) ABI BI %3D 00 01 11 10 ABI 1 ĀCB@I)+ A(BOI) D(A) = BI A 00 01 11 1 D(B) = B AEI BI ĀBI Z = AB I + ĀBE + A B I t ABI A 00 01 10 ABI 1 %3D z = A(B@I)+ ĀCB @1) ACB@ I)+Ā (BEI)