What is the accuracy of always-taken and always-not-taken predictors for this sequence of branch outcomes? T, N, N, N, T (b) For the same sequence (T, N, N, N, T) what is the accuracy of a 1-bit predict-last-taken predictor? Assume that the predictor starts in the "predict not taken" state. (c) What is the accuracy of a 2-bit predictor for the same sequence? Assume that the predictor starts in the "strong not taken" state