CS270-Spring 2018-HW2 Q3. The following code is run on a pipelined processor with ful fon forwarding Loop addi Sto, $to, 1 slt $tl, Sto, 10 bne $tl, $zero, loop addi $so, Ss0, 1 addi $sl, $sl, 1 addi $s2, $s2, 1 Assuming there is no branch prediction and branches are determine in the ME a. notation (Use S for stalls). Write out the first t populate te ofthelo b. Assuming branches are predicted as TAKEN, populate the pipeline dagram using the compact eti for stalls). Write out the first twoiterations of the loop. usine diagram using the compuct notabion(e populate the pipeline c Assuming branches are predicted as NOTTAKEN, populate the pipeline d S for stalls). Write out the first twoiterations of the loop