Assume that your ultra-low-cost processor doesn't have the hardware budget for an integer multiplier implemented in HW, and you don't need 64-bit multiplication results, but you do need 32-bit multiplication results to do some address computations (i.e. you only need a multiplier that returns a 32-bit result, even given two 32-bit inputs) In the SW emulation of multiplication $a0, $a1 below, : mstart: xor $v0, $v0, $v0 mloop: andi $t0, $al, 1 $to, $O, $to and $t1, $a0, $t0 add $v0, $v0, $t1 sll $al, $al, 1 srl $a0, $a0, 1 bne $a1, $0, mloop what instruction, when put in the blue box, would correctly implement unsigned multiplication $v0 = $a0* $a1? OOOO sub mul add beq