The answer for the problem is below:
bgt stalls for 1400 cyclesadd $t2, $t5, $s0 stalls for 1400 cyclessw $t2, 0($s1) stalls for 1400 cycles
The total number of cycles that the code stalls is 4200. Pleaseexplain how the answer is 4200.
Consider the following code running on the 5-stage pipeline discussed in lecture. You may assume that all branches are predicted as not taken. Branches are resolved in the execute stage. Jumps are resolved
OR
OR