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 r1, 0(r5)

add r5, r1, r2

sh r1, 0(r5)

xor r10, r11, r11

slt r5, r1, r5

Execution without forwarding takes cycles. ( )

Execution without forwarding takes ns. ( )

Execution with forwarding takes cycles. ( )

Execution with forwarding takes ns. ( )

Reordered Code: 1 5

lh r1, 0(r5)

add r5, r1, r2

sh r1, 0(r5)

xor r10, r11, r11

slt r5, r1, r5

Execution with code scheduling (reordering) and with forwarding takes cycles. ( )

Execution with code scheduling (reordering) and with forwarding takes ns. ( )

11 points