Question $6$: Instruction Reordering $(15$ points$)$

Consider the following sequence of instructions:

ins$1$: $lwx4,0(x2)$

ins$2$: add $x4,x4,x3$

ins$3$: $swx4,0(x2)$

ins$4$: addi $x2,x2,04$

ins$5$: $lwx5,0(x2)$

ins$6$: add $x4,x4,x5$

ins$7$: addi $x2,x2,0x4$

ins$8$: $swx4,0(x2)$

Even if the forwarding is enabled, there remain some stalls in the pipeline. Try to reorder the

instructions to avoid any remaining pipeline stalls $($show the new sequence$).$ 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 should use similar table representation as given in the previous question for showing the

progression of instructions in the pipeline.