Consider the following code to be executed on a pipelined processor

lw $s1, 40($s6)

add $s6 , $s2, $s2

sw $s6, 48($s1)

a. Include stalls/nops in the code so it executes correctly in the cases of (i) No forwarding (ii) ALU-ALU for warding, (iii) Full forwarding

b. In each case calculate the number of clock cycles required to execute the code

c. Assume further that the clock cycle time is 110 ps with no forwarding, 120 ps with ALU-ALU forwarding and 140 ps with full forwarding. Rank the 3 processorss in the order of performance highest to lowest.

d. Repeat parts a-c if the second instruction changes to add $s6, $s1,$s2 and the clock cycle time with ALU-ALU forwarding increases to 130 ps