Q3. The following code is run on a pipelined processor with full forwarding Loop addi $to, $to, 1 sit Stl, Sto, 10 bne $tl, Szero, loop addi $s0, $s0, 1 addi $s1, $1, 1 addi $s2, $82, 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. Assuming branches are predicte d as TAKEN, populate the pipeline dagram using the compact notation (UseS for stalls). Write out the first two iterations of the loop. b. 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