This question examines the accuracy of $1-$bit dynamic branch predictors for the following repeating patterns $($e$.$g$.,$ in a loop$)$ of branch outcomes. Answer each question $(1-4)$ for each sequence $($a$-$b$)$:

$($a$)$ T$,$ T$,$ T$,$ T$,$ NT

$($b$)$ T$,$ NT$,$ NT$,$ NT$,$ NT

What is the accuracy $($score card$$ in lec $15-16)$ of a $1-$bit dynamic predictor for these sequences of branch outcomes $($a and b$)$ provided we encounter this branch outcome sequence only once?

Assume this predictor starts in the "Predict not taken" state for both a and b$.$