Given a program with the following repeating pattern $($e$.$g$.,$ a loop$)$ of branch outcomes: NT$,$ T$,$ NT$,$ T$,$ NT$.($T$=$branch taken, NT$=$branch not taken$)$

A$.$ What is the accuracy $("$score card" in $15.$pptx$)$ of the $1-$bit predictor for the given sequence of branch outcomes, provided we encounter this branch outcome sequence only once? Assume that the predictor starts off in the "Not Taken" state $("$NT$")?$

Options for A are $0\%,20\%,40\%,60\%,80\%,$ or $100\%$

B$.$ Using the $2-$bit predictor for the given sequence of branch outcomes: NT$,$ T$,$ NT$,$ T$,$ NT$,$ what is $($are$)$ the worst choice$($s$)$ for the starting state $($choose from ST$,$ WT$,$ WNT$,$ and SNT$)?$

Hint: Compute the score cards for each different starting state $-$ SNT$,$ WNT$,$ WT$,$ ST$,$ and then compute and compare the accuracy.

Options for B are SNT$,$ WNT$,$ WT$,$ or ST

C$.$ What is the overall accuracy of the $2-$bit predictor if the given pattern is repeated forever? i$.$e$.,$ T$,$ T$,$ NT$,$ T$,$ NT $|$ T$,$ T$,$ NT$,$ T$,$ NT $...$ to infinity and beyond? Assume that the predictor starts the first iteration in the "Weakly Taken" state $("$WT$").$ Subsequent iterations continue from the branch predictor state at the end of the previous iteration.

Options for C are $0\%,20\%,40\%,60\%,80\%,$ or $100\%$