Q3. The following code is run on a pipelined processor with full forwarding Loop adds Sto, $to,1 sit Stl, t, 10 bne stl, Szero, loop addi Ss0,$, 1 addi Ss1, ssl, 1 addi Ss2, $s2, 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 twoiterations of the loop. c