Rewrite the following segment of code to minimize its performance on a pipelined datapath with forwarding and stalls on a use following a load. That is, reorder the instructions so that the reordered sequence takes the most clock cycles to execute while obtaining the same result. (7 points) lw $2, 100 ($6) 1w $3, 200 ($7) add $4, $2, $3 add $6, $3, $5 sub $8, $4, $6 1w $7, 300 ($8) beq $7, $8, Loop