For the code below, do the following:

$($a$)$ identify data hazards

$($b$)$ put minimum number of NOPs required for proper execution of the given

code on the provided setup.

$($c$)$ How many cycles are required to correctly execute the code given

below? $($Hint: Don't forget the initial latency period of a pipeline.$)$

$($d$)$ Draw the pipeline diagram to show what occurs to the pipeline when a

hazard is detected $($if any$),$ or forwarding occurs $($if any$),$ and how the NOPs

are inserted $($if any$).$

How many cycles in total the code takes in the different scenarios below, to execute assuming a $5-$stage

pipeline?

Don't reorder code, insert NOPs so that the code is hazard free. Assume no forwarding and no hazard

detection is available. How many cycles in total the code takes to execute assuming a $5-$stage pipeline.

Reorder code to the best possible but intent should not change, insert minimum required NOPs so that

the code is hazard free. Assume no forwarding and no hazard detection is available.

Don't reorder code, insert NOPs so that the code is hazard free. Assume forwarding is available. No

hazard detection is available.

Reorder code to the best possible but intent should not change. Assume forwarding and hazard

detection is available.