$4\mathrm{.}25$ Consider the following loop.

Assume that perfect branch prediction is used $($no stalls due to control hazards$),$

that there are no delay slots, that the pipeline has full forwarding support, and that

branches are resolved in the EX $($as opposed to the ID$)$ stage.

$4\mathrm{.}25\mathrm{.}1[10]$$$4\mathrm{.}8>$ Show a pipeline execution diagram for the first two iterations

of this loop.

$4\mathrm{.}25\mathrm{.}2[10]$$$4\mathrm{.}8>$ Mark pipeline stages that do not perform useful work. How

often while the pipeline is full do we have a cycle in which all five pipeline stages are

doing useful work? $($Begin with the cycle during which the addi is in the IF stage.

End with the cycle during which the bnez is in the IF stage.$)$