Task$3$: Assume the following code is executed on a five$-$stage LEGv$8$ pipelined

datapath.

ADDI $x0,x2,$#$5$

LDUR $x3,[x9,$#$8]$

ADD $44,x3,x1$

STUR $x4,[x9,$#$24]$

ADD $x5,x1,x0$

a$.$ Identify all of data dependencies in the code. Which data

dependencies are data hazards that will be resolved via forwarding?

Which dependencies are data hazards that will cause a stall even

with forwarding?

b$.$ If there is no forwarding or hazard detection, insert NOPs to ensure

correct execution. How many cycles are needed to execute the code

in this case?

c$.$ If there is no forwarding unit, can you reduce the number of NOPs

by re$-$ordering the instructions? How many cycles are needed in this

case?

d$.$ If there is a forwarding unit, indicate where forwarding is used and

its type. How many clock cycles are needed to complete the program

execution?