3c) Consider the following code fragment, assuming that d is assigned to R1 bnez addi addi bnez r3,L2 r, L1 ; branch bl (d!-0) ;d--0, sod-1 ri, ro, #1 r3,r1,#-1 LI: ;branch b2 (d!-1) L2 Initial value of d 0 d= 0? Value of d before b2 d = b2 b1 not taken taken taken The above table shows the possible execution sequences for a code seg yes no no 1? yes ot taken yes ot taken io taken ment. Show the action of the (1,1)-bit predictor with 1 bit of correlation, the (1,1)-bit predicator is initialized to taken, and 1-bit of correlation is ini- tialized to taken. The value of d (leftmost column of the table) alternates 1,2,0,2,0. Count the number of misprediction d-?bl pred. bl actionNew bl pred. |b2 pred. |b2 action New b2 pred Note that pred. stands for prediction. 3c) Consider the following code fragment, assuming that d is assigned to R1 bnez addi addi bnez r3,L2 r, L1 ; branch bl (d!-0) ;d--0, sod-1 ri, ro, #1 r3,r1,#-1 LI: ;branch b2 (d!-1) L2 Initial value of d 0 d= 0? Value of d before b2 d = b2 b1 not taken taken taken The above table shows the possible execution sequences for a code seg yes no no 1? yes ot taken yes ot taken io taken ment. Show the action of the (1,1)-bit predictor with 1 bit of correlation, the (1,1)-bit predicator is initialized to taken, and 1-bit of correlation is ini- tialized to taken. The value of d (leftmost column of the table) alternates 1,2,0,2,0. Count the number of misprediction d-?bl pred. bl actionNew bl pred. |b2 pred. |b2 action New b2 pred Note that pred. stands for prediction