1) You have a program that produces the following outcomes on a single branch: T, T, T, N, T, T, T, N, T, T, T, N (where T stands for Taken and N for Not Taken). How many of these branches are predicted correctly if you are using a 1 bit branch predictor, starting out at 0 (where 1 indicates a branch will be taken)?

2) Using the set of outcomes from problem 1, how many of those branches are predicted correctly if you are using a 2 bit branch predictor, starting out at 01 (where 01 is the weakly not taken state)?