1.Construct the one-input finite-state machine of Figure 12.48 to implement two-bit dynamic branch prediction. Minimize your circuit with a Karnaugh map. (a) Use two SR flip-flops. (b) Use two JK...

1.Construct the one-input finite-state machine of Figure 12.48 to implement two-bit dynamic branch prediction. Minimize your circuit with a Karnaugh map.
(a)
Use two SR flip-flops.
(b)
Use two JK flipflops.
(c)
Use two D flip-flops.
(d)
Use two T flip-flops.

2.
Write the control sequence with the one-byte data bus for the von Neumann cycle to fetch the operand specifier and increment PC accordingly. Assume the instruction specifier has been fetched and the control section has determined that the instruction is nonunary.