a) [CLO-3, C4 Analysis, PLO-4 Investigation] n=1; for j=1 to 100 if (n>10) For the above code, identify which branch prediction scheme would result in fewer additions to the CPI for the pipelined processor of Q1 (Branch condition is evaluated in EX satge). Static branch prediction, dynamic branch prediction with 1-bit branch history table and with 2-bit branch history table. Justify you answer by giving examples from the code where performance is improved by using a particular scheme over the other. Determine the size of the branch history table of an (m,n) correlating branch predictor, where last k address bits are used for indexing