Consider the following C++ code and MIPS translation C++ while (a[i] == k) i++; MIPS Loop: sll $t1, $s3, 2 # $t1 = 4i add $t1, $t1, $s6 # $t1 = address of a[i] lw $t0, 0($t1) # $t0 = a[i] bne $t0, $s5, Exit # exit loop if save[i] != k addi $s3, $s3, 1 # i++ j Loop Exit: ... (a) Assuming the first value where a[i] != k is when i=10, determine the number of MIPS instructions executed by the loop if i starts at 0. (b) In the above code two branch/jump instructions are executed for each loop iteration (except the last). This turns out not to be optimal. Rewrite the above code so that only 1 branch/jump instruction is executed for each loop. Determine the total number of instructions executed using the conditions stated in part (a).