[5] (Q.3-17) An (m,n) correlating branch predictor uses the behavior of the most recent m executed branches to choose from 2" predictors, each of which is an n-bit predictor. For this exercise, consider a (1,2) correlating predictor that can track four branches. For the following branch outcomes, provide each prediction, the table entry used to make the prediction, any updates to the table as a result of the prediction, and the final misprediction rate of each predictor. Assume that all branches up to this point have been taken. Initialize each predictor to the following: (Note that please use "2-bit Saturating Counter" in Lecture 11-Page 13 to figure out your answer.) 1. Correlating predictor Table 1 Predictiorn Branch Last outcome Entry 10 01 4 01 10 Outcome Branch PC(word address) 458 279 120 279 458 279 120 458 120 NT NT NT NT NT [5] (Q.3-17) An (m,n) correlating branch predictor uses the behavior of the most recent m executed branches to choose from 2" predictors, each of which is an n-bit predictor. For this exercise, consider a (1,2) correlating predictor that can track four branches. For the following branch outcomes, provide each prediction, the table entry used to make the prediction, any updates to the table as a result of the prediction, and the final misprediction rate of each predictor. Assume that all branches up to this point have been taken. Initialize each predictor to the following: (Note that please use "2-bit Saturating Counter" in Lecture 11-Page 13 to figure out your answer.) 1. Correlating predictor Table 1 Predictiorn Branch Last outcome Entry 10 01 4 01 10 Outcome Branch PC(word address) 458 279 120 279 458 279 120 458 120 NT NT NT NT NT