Assume a piece of code which executes two branches b$1$ and b$2$ in altemating sequence $($i$.$e$.$ b$1,$b$2,$b$1,$b$2,$b$1,$b$2......).$ The first six actual outcomes of bl and b$2$ are as shown below:

b$1$: NTT NTT NT NT

$62$: NTT NTT NT NT

Assume that a simple $2-$bit predictor is used. All entries of predictor are initialized to $\text{'}11\text{'},$ and there is no aliasing in BHT$.$ The two bits of BHT are adjusted as shown on the state diagram below. Draw a table as shown below in your answer sheet and show the predictions made for each execution of the branches. Show your work.$\backslash$table$[[$b$1$ actual,NT$,$T$,$NT$,$T$,$NT$,$NT$],[$b$1$ predicted,,,,,,$],[$b$2$ actual,NT$,$T$,$NT$,$T$,$NT$,$NT$],[$b$2$ predicted,,,,,,$]]$