27. The finite-state machine of Figure 12.48 for branch prediction moves from predicting no branch to predicting branch only if two consecutive branches were made (and similarly for moving from predicting branch to predicting no branch).

(a) Draw a finite-state machine that moves from predicting no branch to predicting branch only if three consecutive branches were made (and similarly for moving from predicting branch to predicting no branch). (b)

How many prediction bits would be necessary for the implementation of the machine?