Th e importance of having a good branch predictor depends on how oft en conditional branches are executed. together with branch predictor accuracy, this will determine how much time is spent stalling due to mispredicted branches. in this exercise, assume that the breakdown of dynamic instructions into various instruction categories is as follows: r-type beq jmp lw sw 40% 25% 5% 25% 5% also, assume the following branch predictor accuracies: always-taken always-not-taken 2-bit 45% 55% 85%4.15.1 [10] < §4.8> stall cycles due to mispredicted branches increase the cpi. what is the extra cpi due to mispredicted branches with the always-taken predictor? assume that branch outcomes are determined in the ex stage, that there are no data hazards, and that no delay slots are used.4.15.2 [10] < §4.8> repeat 4.15.1 for the "always-not-taken" predictor.4.15.3 [10] < §4.8> repeat 4.15.1 for for the 2-bit predictor.4.15.4 [10] < §4.8> with the 2-bit predictor, what speedup would be achieved if we could convert half of the branch instructions in a way that replaces a branch instruction with an alu instruction? assume that correctly and incorrectly predicted instructions have the same chance of being replaced.4.15.5 [10] < §4.8> with the 2-bit predictor, what speedup would be achieved if we could convert half of the branch instructions in a way that replaced each branch instruction with two alu instructions? assume that correctly and incorrectly predicted instructions have the same chance of being replaced.