P$1.$

Problems in this exercise refer to the following sequence of instructions, and assume that it is

executed on a five$-$stage pipelined data path:

add $s$3,$ $s$1,$ $s$0$

lw $s$2,4($$s$3)$

lw $s$1,0($$s$4)$

or $s$2,$ $s$3,$ $s$2$

sw $s$2,0($$s$3)$

a$)$ If there is no forwarding or hazard detection, insert NOPS$/$bubble to ensure correct execution.

b$)$ Now, change and$/$or rearrange the code to minimize the number of NOPs$/$bubbles needed. You

can assume register $t$0$ can be used to hold temporary values in your modified code.