Assume a branch instruction with the following pattern T' T, T, N, N, T, T, T, N, N, T, T, T, N, N. where T taken and N: not-taken Part 1: What are the success percentages of a static Taken predictor, of an 1-bit predictor with initial value 1 (state of T), and of a 2-bit predictor, with initial value 3 (state of T). Which predictor would you select to implement? The 2-bit predictor is using the following FSM: 01 11 T 10 Part 2: Assume an (m, 1) local-history predictor. Which is the minimum m required so that the predictor has optimal performance? For this number of m, show the contents of your PHT on a table with two columns: PHT Index and Prediction