Consider the MIPS code below: addi Sto, $t1,1 sub $t1, $s0,$s1 add $sl, $to,$t1 (a) Assume that we execute the code on a superscalar MIPS-processor with four func- tional units. What is then the maximal instructions per clock cycle (IPC) for the code snippet? Note that the IPC is computed as the average instructions per clock cycles when executing the above four instructions. (b) What kind of dependency must an out-of-order processor take care of if it switches the order of the addi and the sub instructions? How can the processor resolve the hazard that occurs if the instructions are swapped? Consider the MIPS code below: addi Sto, $t1,1 sub $t1, $s0,$s1 add $sl, $to,$t1 (a) Assume that we execute the code on a superscalar MIPS-processor with four func- tional units. What is then the maximal instructions per clock cycle (IPC) for the code snippet? Note that the IPC is computed as the average instructions per clock cycles when executing the above four instructions. (b) What kind of dependency must an out-of-order processor take care of if it switches the order of the addi and the sub instructions? How can the processor resolve the hazard that occurs if the instructions are swapped