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 100 nano sec.

lb ri, 0(r7) sub r7, ri, r2 sb ri, 0 (r7) xor r10, r11, r11 sltr7, rl, r7 Execution without forwarding takes ) .cycles Execution without forwarding takes ) .15 Execution with forwarding takes ) .cycles Execution with forwarding takes ) .15 1 5 :Reordered Code lb r1, 0(r7) sub r7, rl, r2 sb rl, 0 (r7) xor r10, r11, r11 slt r7, r1, r7 Execution with code scheduling (reordering) and with forwarding takes ) .cycles Windows. Execution with code scheduling (reordering) and with forwarding takes ) .15