Assume, the same instruction sequence given in Question 2. Iw x2,0(x0) lw x1,4(x0) add x4,x1,x2 sw 4,12(x0) Iw 3,8(x0) add 5,x1,x3 sw 5,16(x0) Even if forwarding is enabled, there remain some stalls in the pipeline. Try to reorder the instructions to avoid any remaining pipeline stalls (you should show the new sequence, too). How many cycles does it take to execute the given instructions when instructions are reordered? (Note: make sure you do not violate any dependencies when you reorder the instructions) You can use the following representation for the pipeline to simplify the depiction (this is for just illustration purpose)