3. Consider the following code (this should look familiar from HW3...) li to, 5 li St1, 0x10010004 addi $t0, $t0,-1 lw $t1, 0(St1) bne $to, Szero, loop add vo, $to, Szero loop: b. [5] How many dynamic instructions and cycles would this take with perfect branch prediction