A snapshot of the takenot-taken behavior of a branch is: (first instruction) TTTIIIIINNTINNTNNT (last instruction) a) If the branch predictor used is always-taken", how many of the last ten branches are predicted correctly? b) If the branch predictor used is a "one-bit last time predictor, how many of the last ten branches are predicted correctly? c) If the branch predictor used is a 2-bit counter-based prediction, how many of the last ten branches are predicted correctly? d) Assume that in the code, 100 instructions are executed. Among these 100 instructions, 10 of them are those last 10 branch operations. Also, the code is executed in a pipelined architecture. Each stage takes 1 cycle and branch resolution takes 5 stages. Assuming that there is not any memory operations and data dependencies, calculate the Cycle Per Instructions (CPI) for a, b and c