Studing for my architecture exam on Tuesday and I have a question. I think I know the answer but I want to make sure. My answer is in bold Given the following problem, assuming 5 execution steps and no pipelining
lw $t2, 0($t3)
lw $t3, 4($t3)
beq $t2, $t3, Label #assume not
add $t5, $t2...