3. Consider the following code (this should look familiar from HW3...) li to, 5 li St1, 0x10010004 addi to, to,-1 loop: bne Sto, $zero, loop add Svo, to, $zero [10] Assume a 1 bit branch predictor is used, where the original state is Not Taken. Give the full log of the branch history table, showing predicted and actual branches. Underline the incorrect predictions. What is the final state of the branch prediction, and how many cycles were required in total? c. 3. Consider the following code (this should look familiar from HW3...) li to, 5 li St1, 0x10010004 addi to, to,-1 loop: bne Sto, $zero, loop add Svo, to, $zero [10] Assume a 1 bit branch predictor is used, where the original state is Not Taken. Give the full log of the branch history table, showing predicted and actual branches. Underline the incorrect predictions. What is the final state of the branch prediction, and how many cycles were required in total? c