em 5: Branch Prediction (20 points) pro finite state machine for the 2-bit saturating counter branch prediction method. Consider the praw ch prediction in ILP processors using this method on the example code shown branches 81,82,83. Can you get better performance by changing the branch prediction below with three method? Explain. int i = 0; do l x = 50-i; yi -50 if (x > 0) /* B1 : History bits = IIT */ /* B2: History bits = NN */ ..straight line code that doesn't change i or... if (y 0) ...straight 1ine code that doesn't change i . i i+l } while (i