Q$1[100]$: An $(m,n)$ correlating branch predictor uses the behavior of the most recent $m$ executed

branches to choose from $2^m$ predictors, each of which is an $n-$bit predictor. For this exercise,

consider a $(1,2)$ correlating predictor that can track four branches. For the following branch

outcomes, provide each prediction, the table entry used to make the prediction, any updates to the

table as a result of the prediction, and the final misprediction rate of the predictor. Assume that all

branches up to this point have been not$-$taken. Initialize each predictor to the following:

Table $1$:

Correlating Predictor

Note: Please use $"2-$bit Saturating Counter" in Lecture $13,$ Slide $13$ to figure out your answer.

Fill out the following table and calculate the mis$-$prediction rate:

What is the mis$-$prediction rate for the correlating predictor?