Show an execution timeline for the code executing on a $5$ stage MIPS pipeline. Assume forwarding whenever possible. Assume the beq is predicted TAKEN but is ACTUALLY NOT TAKEN. Assume branch outcome determined and PC updated in MEM stage. Assume all j instructions are correctly predicted TAKEN. Show forwarding whenever it occurs. Show the timeline to the end of the sequence.

LOOP:

addi $to$,$ $to$,1$ add $t$5,$ $s$1,$ $t$2$ lw $t$6,0($$t$5)$ add $t$7,$ $t$4,$ $t$6$ beq $t$0,$ $t$1,$ LOOP

j

DONE

HERE:

srl $t$2,$ $t$0,2$ add $t$3,$ $s$0,$ lw $t$4,0($$t$3)$ $t$2$

DONE:

add $t$1,$ $t$5,$ $zero addi $t$7,$ $$7,200$