(MIPS) In the class, we have shown how to maximize performance on our pipelined datapath with forwarding and stalls on a use following a load. Rewrite the following code to minimize performance on this datapath that is, reorder the instructions so that this sequence takes the most clock cycles to execute while still obtaining the same result: lw $3, 0($5) lw $4, 4($5) add $7, $7, $3 add $8, $8, $4 add $10, $7, $8 sw $6, 0($5) beq $10, $11, loop