Consider the following code for the following problems loop: LW R4, 0 (R3) ADDI R3, R3, 4 SUBI R1, R1, 1 Assume R3 points to the array with all 0 entries R1-R2 5. bl: BEQ RO, R4, b2 ADDI R2, R2, 1 # R0 is zero b2: BNE RO, R1, loop ADDI R3, R3, 4 1) If there is a branch delay slot and result of R2 stays even after branch is taken. What is the value of R2 when the loop finishes? 2) If there is no branch delay slot, what is the value of R2 when the loop finishes? 3) Which behavior makes the most sense? 4) Now assume we use a global branch-predictor with no branch delay slot. Assume R1 starts out with value 10. R3 points to the array with all 0 entries. How well does the predictor work