Consider the following sequence of actual outcomes for a single static branch where T means the branch is taken and N means the branch is not taken. Also, assume that this is the only branch in the program. Assume that we try to predict this sequence with the 1-bit predictor (which is initialized to the N state. What is the predicted sequence? How many branches are mis-predicted? How about using the 2-bit predictor (which is initialized to the T state)