This problem explores pipeline design. As discussed earlier, pipelining involves balancing the pipe stages. Good pipeline implementations minimize both internal and external fragmentation to create simple balanced designs. Below is a nonpipelined implementation of a simple microprocessor that executes only ALU instructions, with no data hazards:

P$2\mathrm{.}18$ Generate a pipelined implementation of the simple processor outlined in the figure that minimizes internal fragmentation. Each subblock in the diagram is a primitive unit that cannot be further partitioned into smaller ones. The original functionality must be maintained in the pipelined implementation. Show the diagram of your pipelined implementation. Pipeline registers have the following timing requirements:

$0\mathrm{.}5-$ns setup time

$1-$ns delay time $($from clock to output$)$

P$2\mathrm{.}19$ Compute the latencies $($in nanoseconds$)$ of the instruction cycle of the nonpipelined and the pipelined implementations.

P$2\mathrm{.}20$ Compute the machine cycle times $($in nanoseconds$)$ of the nonpipelined and the pipelined implementations.

P$2\mathrm{.}21$ Compute the $($potential$)$ speedup of the pipelined implementation in Problems $18-20$ over the original nonpipelined implementation.

P$2\mathrm{.}22$ What microarchitectural techniques could be used to further reduce the machine cycle time of pipelined designs? Explain how the machine cycle time is reduced.

P$2\mathrm{.}23$ Draw a simplified diagram of the pipeline stages in Problem $18$; you should include all the necessary data forwarding paths.