This exercise examines the accuracy of various branch predictors for the following repeating pattern [e.g. in a loop) of branch outcomes: T, T, T, NT, T, NT. What is the accuracy of always-taken and always-not-taken predictors for this sequence of branch outcomes? What is the accuracy of the two-bit predictor for the first five branches in this pattern, i.e. T, T, T, NT, T? Assume that the predictor starts off in the bottom left state from Figure 4.63 (predict not taken). What is the accuracy of the two-bit predictor if the pattern is repeated forever