Plzzzzzzzzzz do fast

Problems in this exercise refer to the following sequence of instructions, and assume that it is executed on a five-stage pipelined datapath: add $s3, $s1, $so lw $82, 4($s3) lw $si, o($94) or $55, $s3, $s1 sw $55, O($S2) a. If there is no forwarding or hazard detection, insert NOPs to ensure correct execution. How many NOPs are needed? b. Now, rearrange the code to minimize the number of NOPs needed if there is no forwarding. How many NOPs are needed? c. If there is forwarding, insert NOPs to the original sequence to ensure correct execution. How many NOPs are needed? d. If there is forwarding, which register is being forwarded in the 4th cycle during the execution of this code? e. What is the speedup achieved by adding full forwarding to this pipeline for the original sequence, compared with that had no forwarding? Assume clock cycle time doesn't change by adding forwarding