E. Consider each of the following sets of instructions. Decide the minimum number of stalls needed in each case with and without forwarding. Assume the five stage MIPS pipeline discussed in class and that equality for branches are checked at the Decode stage. Assume delayed branching. (2 points) Number of stalls required? Without forwarding With forwarding addiu $tl, Sto, 5 addu $t4, $t3, $tl addu Sto, $t3, $to addu $tl, $t2, $t3 beq to, t1, Done addu $t5, $t5, $s5 sw tl, 0 (Ss1) addu $to, $s0, Stl