Consider the following code fragment, assuming that d is assigned to R1: bnez rl, Ll ; branch bl (dl-0) addi r1, r0, 1 d0, so d-1 bnez r3,L2 ;branch b2 (d!-1) \ L2: lendtabular} Value of d d-1 b2 before b2 initial value of d d= 07 bl NT 1 yes no no yesNT yes NT no 2 2 The above table shows the possible execution sequences for a code segment. Show the action of the (1,1)-bit predictor with 1 bit of correlation, the (1,1)-bit predicator is initialized to not taken, and 1-bit of correlation initialized to not-taken. The value of ?d$ (leftmost column of the table) alternates 1,2,0,2,0. Count the number of misprediction Consider the following code fragment, assuming that d is assigned to R1: bnez rl, Ll ; branch bl (dl-0) addi r1, r0, 1 d0, so d-1 bnez r3,L2 ;branch b2 (d!-1) \ L2: lendtabular} Value of d d-1 b2 before b2 initial value of d d= 07 bl NT 1 yes no no yesNT yes NT no 2 2 The above table shows the possible execution sequences for a code segment. Show the action of the (1,1)-bit predictor with 1 bit of correlation, the (1,1)-bit predicator is initialized to not taken, and 1-bit of correlation initialized to not-taken. The value of ?d$ (leftmost column of the table) alternates 1,2,0,2,0. Count the number of misprediction