Fill out the tables. Consider a loop that is entered two times in sequence in a program. Each time

it is entered, the loop performs $4$ iterations. Each iteration executes two branches in sequence with the

following outcomes:

When Branch $2$ is not taken at iteration $4,$ the program leaves the loop. Record the predictions of

the three branches using the following two branch predictors: $(1)$ a $2-$bit dynamic up$/$down saturation

counter predictor $($initial state $00),(2)$ a $(1,1)$ correlated predictor $($initial state N$/$N$).$ Assume that the

outcome of the branch instruction executed before entering the loop is $N.$

$($a$)2-$bit saturation counter predictor

Branch $1$

Branch $2$

$($b$)(1,1)$ correlated predictor

Branch $1$

Branch $2$