For a pipeline processor, consider the implementation of the $2-$bit branch predictor $($four state: strong predict

taken, weak predict taken, weak predict not taken, and strong predict not taken, as shown in Figure $4\mathrm{.}62$ of the

text book.$)$ Initially the predictor starts off in the strong predict not taken state. What is the accuracy of the

predictor for the following repeating branching pattern of a conditional branch instruction inside a

programming loop: T$,$ NT$,$ T$,$ T$,$ NT$.$