Assume this is executed on a standard 5 stage mips pipeline with no branch prediction. how many dynamic instructions are executed, including nops? how does this relate to the number of cycles? consider the following code

li $t0, 5

li $t1, 0x10010004

loop: addi $t0, $t0, -1

lw $t1, 0($t1)

bne $t0, $zero, loop

add $v0, $t0, $zero

a) assume this is executed on a standard 5 stage mips pipeline with no branch prediction. how many dynamic instructions are executed, including nops? how does this relate to the number of cycles?

b) how many dynamic instructions and cycles would this take with perfect branch prediction?

c) 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?

d) this code is executed on a single cycle machine (m1) at 100 mhz, and on a multicycle machine with 1 bit branch predictor (m2) at 133.33 mhz. compute texe (t execution) on both m1 and m2. what is the total branch misprediction overhead (that is, what percentage of the total execution time is due to mispredicting the branch? )