Q$2.$ Assume a piece of code which executes two branches $b1$ and $b2$ in alternating sequence $($i$.$e$.$

$b1,b2,b1,b2,b1,b2,$dotsdots. The first six actual outcomes of $b1$ and $b2$ are as shown below:$-$

bl: NT T NT T NT NT

b$2$: NT T NT T NT NT

$($b$)$ Repeat part $($a$)$ with a Gag predictor with $2$ bit GBHR and $2$ bit GPHT$.$ All entries of GBHR are

initialized to $\text{'}$T$\text{'}.$ The two bits of GPHT are adjusted as a saturating counter and are initialized to the

maximum count.Q$2.$ Assume a piece of code which executes two branches b$1$ and b$2$ in alternating sequence $($i$.$e$.$

$b1,b2,b1,b2,b1,b2,$dotsdots. The first six actual outcomes of $b1$ and $b2$ are as shown below:

bl: NT T NT T NT NT

b$2$: NT T NT T NT NT

$6($a$)$ Assume that a PAg branch predictor with $2$ bit PABHR and $2$ bit GPHT is used. All entries of PABHR

are initialized to $\text{'}T\text{'},$ and there is no aliasing in PABHR. The two bits of GPHT are adjusted as a

saturating counter and are initialized to the maximum count. Draw a table as shown below in your

answer sheet and show the predictions made for each execution of the branches. Also write the final

values of all counters. Show your work.

$($b$)$ Repeat part $($a$)$ with a Gag predictor with $2$ bit GBHR and $2$ bit GPHT$.$ All entries of GBHR are

initialized to $\text{'}T\text{'}.$ The two bits of GPHT are adjusted as a saturating counter and are initialized to the

maximum count.

$[12]$