Assume that the machine running the code above has a global branch predictor with the following properties.

- History register: 2 bits

- History table: 4 entries

- History table entry: 10-bit signed, saturating counter (i.e., the value range is 512 511)

- Assume that all table entries are initialized to 0 before the loop is executed.

- As we execute the code, a table entry is incremented by one whenever a branch mapped to the entry is taken, whereas it is decremented by one whenever the branch mapped to the entry is not taken.

Assume that the loop is iterated 60 times. Calculate the expected value for the 4 table entries after the iterations. Show your work. (Hint: For an iteration of the loop, consider the probability that makes both b1 and b2 taken. Given that condition, consider the probability that makes b3 incremented or decremented ..... )