Question 6 (Bonus) [10 points] (a) In general, why does a two bit branch predictor with four states perform better when compared to a one bit branch predictor? (b) Why are write after read and write after write not a concern in the five stage MIPS pipeline discussed in the class? Boolean Rules: [ egin{array}{l} A+ar{A}=1 \ A cdot ar{A}=0 \ ar{A}=A \ A cdot(A+B)=A end{array} ]

Question 6 (Bonus) [10 points] (a) In general, why does a two bit branch predictor with four states perform better when compared to a one bit branch predictor? (b) Why are write after read and write after write not a concern in the five stage MIPS pipeline discussed in the class? Boolean Rules: A+A=1AA=0A=AA(A+B)=A