6. [10 points] The current state of a gshare prediction table is shown below. After discarding the lowest 2 bits of the PC (don't forget to do this!) to form PC, the index is formed by XORing the low 3 bits of PC" with the global branch history register (BHR). The BHR is also 3 bits. The most recent branch outcome is shifted into the lowest bit position of the BHR (i.e., shift the BHR left). 0 2 1 2 The current branch PC is 00F4 (in hex) and the current BHR is 011 (in binary). The current branch's actual outcome is not-taken a. B points] What was the outcome of the previous branch in the dynamic instruction stream, taken or not-taken? How can you tell? b. [4 points] What is the value of the counter used to predict the current branch? What is the prediction, taken or not-taken? Show your work. c. 3 points] Show the new state of the prediction table and BHR, after updating them with the actual outcome of the current branch 6. [10 points] The current state of a gshare prediction table is shown below. After discarding the lowest 2 bits of the PC (don't forget to do this!) to form PC, the index is formed by XORing the low 3 bits of PC" with the global branch history register (BHR). The BHR is also 3 bits. The most recent branch outcome is shifted into the lowest bit position of the BHR (i.e., shift the BHR left). 0 2 1 2 The current branch PC is 00F4 (in hex) and the current BHR is 011 (in binary). The current branch's actual outcome is not-taken a. B points] What was the outcome of the previous branch in the dynamic instruction stream, taken or not-taken? How can you tell? b. [4 points] What is the value of the counter used to predict the current branch? What is the prediction, taken or not-taken? Show your work. c. 3 points] Show the new state of the prediction table and BHR, after updating them with the actual outcome of the current branch