CS270-Spring 2018-HW2 Name: Q3. The following code is run on a pipelined proaessor with full forwarding Loop addi Sto, sto, 1 slt Stl, sto, 10 bne $tl, Szero, loop addi $s0, $s0,1 addi Ss1, Ss1, 1 addi $s2, $s2. 1 there is no branch prediction and branches are determine in the ME phase, populate the pipeline iagram usin ng the compact notation (Use S for stalls). Write out the first two iterations of the loop. d as TAKEN, populate the pipeline diagram using the compact notation (Use S Assuming branches are predicte for stalls). Write out the first two iterations of the loop b. c Assuming branches are predicted as NOT TAKEN, populate the pipeline diagram using the compact notation (Use S for stalls). Write out the first two iterations of the loop. CS270-Spring 2018-HW2 Name: Q3. The following code is run on a pipelined proaessor with full forwarding Loop addi Sto, sto, 1 slt Stl, sto, 10 bne $tl, Szero, loop addi $s0, $s0,1 addi Ss1, Ss1, 1 addi $s2, $s2. 1 there is no branch prediction and branches are determine in the ME phase, populate the pipeline iagram usin ng the compact notation (Use S for stalls). Write out the first two iterations of the loop. d as TAKEN, populate the pipeline diagram using the compact notation (Use S Assuming branches are predicte for stalls). Write out the first two iterations of the loop b. c Assuming branches are predicted as NOT TAKEN, populate the pipeline diagram using the compact notation (Use S for stalls). Write out the first two iterations of the loop