The following trace represents the actual outcome of a single branch instruction for a certain program (a) Assume you have 1 bit and 2 bit non-correlating predictors that are initially defaulted to taken and weakly taken, respectively. Fill in the table showing updated predictions and hits/misses for a 1 bit and 2 bit non-correlating predictors. Trace T T F F T FTF F F T F 1-bit hit/miss 2-bit hit/miss WT (6) The following trace was generated for a program in which you want to evaluate a (1,1) branch prediction scheme. The program loops such that the branches are executed in order and continue repeating (i.e., brl -> br2 -> br3 -> bl -> br2 .....). The default prediction value WT/WT for the first branch implies a prior branch was not taken. Fill in the Table below. 1 2 3 4 5 Br1 TTTFF Br2 TFTFF Br3 FTFIT Branch 1 Pred | Actual WT/WT Branch 2 Pred Actual NT/NT Branch 3 Pred Actual NT/NT The following trace represents the actual outcome of a single branch instruction for a certain program (a) Assume you have 1 bit and 2 bit non-correlating predictors that are initially defaulted to taken and weakly taken, respectively. Fill in the table showing updated predictions and hits/misses for a 1 bit and 2 bit non-correlating predictors. Trace T T F F T FTF F F T F 1-bit hit/miss 2-bit hit/miss WT (6) The following trace was generated for a program in which you want to evaluate a (1,1) branch prediction scheme. The program loops such that the branches are executed in order and continue repeating (i.e., brl -> br2 -> br3 -> bl -> br2 .....). The default prediction value WT/WT for the first branch implies a prior branch was not taken. Fill in the Table below. 1 2 3 4 5 Br1 TTTFF Br2 TFTFF Br3 FTFIT Branch 1 Pred | Actual WT/WT Branch 2 Pred Actual NT/NT Branch 3 Pred Actual NT/NT