2a) Assume there is one branch-delay slot, unroll and schedule the code so that it has no stall. What is the minimum number of iterations needed to reduce all stall? and assume a single-issue pipeline with latencies as follows instructionlatency in instruction producing result using result clock cycles FP ALU op FP ALU op load double load double FP ALU op store double FP ALU op store double 3 2 0 As well, assume an integer load latency of 1 and an integer ALU operation latency of 0. Also, assume a one cycle delayed branch Loop: .d f0,0(rl) add.d fo.fo.2 add.d fo.f0,f4 l.d f8,0(r3) add.d fo,f0,f8 s.d f,0(r2) addi r3,r3,#-8 addi r2,r2,#-8 addi r1,r1,#-8 bnez r,Loop 2a) Assume there is one branch-delay slot, unroll and schedule the code so that it has no stall. What is the minimum number of iterations needed to reduce all stall? and assume a single-issue pipeline with latencies as follows instructionlatency in instruction producing result using result clock cycles FP ALU op FP ALU op load double load double FP ALU op store double FP ALU op store double 3 2 0 As well, assume an integer load latency of 1 and an integer ALU operation latency of 0. Also, assume a one cycle delayed branch Loop: .d f0,0(rl) add.d fo.fo.2 add.d fo.f0,f4 l.d f8,0(r3) add.d fo,f0,f8 s.d f,0(r2) addi r3,r3,#-8 addi r2,r2,#-8 addi r1,r1,#-8 bnez r,Loop