The following code is run on a pipelined processor with full forwarding

Loop

addi $t0, $t0, 1

slt $t1,$t0, 10

bne $t1,$zero,loop

addi $s0, $s0, 1

add i$s1, $s1, 1

addi $s2, $s2, 1

a.

Assuming there is no branch prediction and branches are determine in the ME phase, populate the pipeline diagram using the compact notation (Use S for stalls). Write out the first two iterations of the loop.

im not sure were to begin my pipeline "no branch prediction and branches" has me confused

would i start at addi or the bne?