Problems in this exercise refer to the following sequence of

instructions, and assume that it is executed on a five$-$stage pipelined

datapath:

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)$