Q3. The following code is run on a pipelined processor with full forwarding Loop addi Sto, sto, 1 eltmt1, $to, 10 bne $t1, Szero, loop addi $s1, $s1, 1 addi $s2, $32, 1 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. a. b. Assuming branches are predicted as TAKEN, populate the pipeline diagram using the compact notation (Use S for stalls). Write out the first two iterations of the loop. 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. c