2. (15 points) Assume the pipeline structure of Figure 4.51 on page 362.Lets assume that this datapath NEITHER stalls NOR forwards on hazards, so you must add nop instructions. Rewrite the code of the block copy operation shown below inserting as few nop instructions as needed for proper exccution; reorder the instructions, if possible, to minimize the number of nops while preserving correctness. Do not forget that branches and jumps are actually delayed branches& jumps with their delayed slots needed to be taken care of (filled in) in a pipelined MIPS processor! Another hint: Try to optimize the code(i.e., reduce the number of nops) by changing offset value in memory access instructions (when necessary) while preserving correctness Iw S1, 100 (S2) addi $1, S1, 1 sw $1, 500 (S2) addiu $2, S2, 4 bne $2, $10, LOOP LOOP: 2. (15 points) Assume the pipeline structure of Figure 4.51 on page 362.Lets assume that this datapath NEITHER stalls NOR forwards on hazards, so you must add nop instructions. Rewrite the code of the block copy operation shown below inserting as few nop instructions as needed for proper exccution; reorder the instructions, if possible, to minimize the number of nops while preserving correctness. Do not forget that branches and jumps are actually delayed branches& jumps with their delayed slots needed to be taken care of (filled in) in a pipelined MIPS processor! Another hint: Try to optimize the code(i.e., reduce the number of nops) by changing offset value in memory access instructions (when necessary) while preserving correctness Iw S1, 100 (S2) addi $1, S1, 1 sw $1, 500 (S2) addiu $2, S2, 4 bne $2, $10, LOOP LOOP