How much time the following code sequence takes when executed without forwarding and with forwarding? Can you reorder the code to avoid all stalls? if yes, please reorder the code and execute the code with forwarding while providing the time it takes. Assume that each clock cycle takes 10 nano sec.

lh r8, 0(r9)

add r9, r8, r2

sh r8, 0(r9)

xor r10, r11, r11

slt r9, r8, r9

Execution without forwarding takes [ ] cycles. (Write the number without a unit or space to get the degree)

Execution without forwarding takes [ ] ns. (Write the number without a unit or space to get the degree)

Execution with forwarding takes [ ] cycles. (Write the number without a unit or space to get the degree)

Execution with forwarding takes [ ] ns. (Write the number without a unit or space to get the degree)

Reordered Code: Arrange the previous code by writing the new instruction order number next to it from 1 to 5 if possible to get rid of the Hazard

[ ] lh r8, 0(r9)

[ ] add r9, r8, r2

[ ] sh r8, 0(r9)

[ ] xor r10, r11, r11

[ ] slt r9, r8, r9

Execution with code scheduling (reordering) and with forwarding takes [ ] cycles. (Write the number without a unit or space to get the degree)

Execution with code scheduling (reordering) and with forwarding takes [ ] ns. (Write the number without a unit or space to get the degree)