$.(6)$ A branch prediction technique is referred to as the tournament predictor. In this case, there are

effectively three predictors. One of these is actually a $$predictor predictor$,$ which chooses between

the other predictors. Let$$s call the master predictor P$0.$ The other two are P$1$ and P$2.$ P$0$ starts out

accepting P$1$s predictions. Then....

$$ As long as P$1$ is right, P$0$ keeps accepting P$1$s predictions

$$ If P$1$ is wrong and P$2$ is right, P$0$ switches to accepting P$2$s predictions

$$ If both predictors are wrong, P$0$ keeps accepting the current predictor

$$ And obviously, when P$2$ is wrong, and P$1$ is right, P$0$ switches back

Consider that P$1$ is the $1-$bit predictor in question $1$ and P$2$ is the $2-$bit predictor $3.$ Using the branch

history:

TNTNTTTTTTTNNNNNNNNTTT

show what the ultimate predictions are from P$0$ and clearly indicate whether it is accepting predic$-$

tions from P$1$ or P$2$