For the one-hot encoded Moore-type finite state machine represented by the following state transition diagram, use the Set OR Hold 1 method to obtain the excitation equations for the D-type flip-flop realisation. The state code is given by: A Key A Q3 Q2 Q1Q0 A 0001 Ā 1000 Select the INCORRECT excitation equation. A D₁ =QA+QA B D₁₂ =Q¸Ã+QA 1 D₁₂=QA D D₁₂ = Q₁₂+Q₁₁ 0010 A 0100 KA Question 4 20 Points Carefully study the state transition diagram given in the figure below and complete the next-state and output table. You may want to make a suitable copy of the diagram. Key in/out State in/out Q1Q0 00 <8 A/Z B 01 A/Z A/Z A/Z A/Z D A/Z C 10 11 A/Z A/Z Next-state and Output table Present state Q₁ Qo A Next state D₁Do (2-bit number expected for this column) Output, Z (1-bit number expected for this column) 000 001 01 Blank 1 0 Blank 2 010 Blank 3 Blank 4 011 Blank 5 Blank 6 100 Blank 7 Blank 8 118 Question 1 10 Points An 8-to-1 multiplexer has signals A, B, and C connected to the Selection inputs S1, S1, and SO, respectively. The data inputs 10 through 17 are as follows: 11=12=17=0; 13=15=1; 10=14=NOT(D); and 16=D 8-to-1 Mux IO I1 I2 13 F 14 15 16 17 S2 S1 50 A B C Determine the Boolean function that the multiplexer implements. A F= (A+B).C+B.C.D+A.B.C.D B Ⓑ F= (A+B).C+B.C.D+A.B.C.D CF=A.C+B.C.D+A.B.C.D D F=A.C+B.C.D+A.B.C.D E M ΤΙ m pl ai PADHσu C