3. (20%) Consider running the below program on the 5-stage pipelined processor with early branch resolution. Recall that in this processor: branches are resolved in the ID stage; branches are always predicted-not-taken, so a take branch (including jumps) results in a 1-cycle penalty. addi x5, x0, 5 WHILE: beq x5, x0, DONE addi x5, x5,-1 a x0, WHILE DONE (1). (5%) In running the above program, how many dynamic instructions are run? Last Name: First Name: abc123: (2). (12%) How many cycles does it need to finish running the whole program? This measures the time from the first stage of the first instruction to the last stage of the last instruction. (3). (3%) What is the CPI of this program running on the processor? 3. (20%) Consider running the below program on the 5-stage pipelined processor with early branch resolution. Recall that in this processor: branches are resolved in the ID stage; branches are always predicted-not-taken, so a take branch (including jumps) results in a 1-cycle penalty. addi x5, x0, 5 WHILE: beq x5, x0, DONE addi x5, x5,-1 a x0, WHILE DONE (1). (5%) In running the above program, how many dynamic instructions are run? Last Name: First Name: abc123: (2). (12%) How many cycles does it need to finish running the whole program? This measures the time from the first stage of the first instruction to the last stage of the last instruction. (3). (3%) What is the CPI of this program running on the processor