a) Draw state transition diagrams for 1-bit branch prediction buffer and 2-bit branch prediction buffer respectively.

b) Give an example showing how 1-bit BPB beats 2-bit BPB in terms of branch prediction accuracy. Write the actual outcome sequence for one branch instruction. Use T to denote a Taken Branch, NT denotes a Not Taken Branch. For example, you could say a pattern like T T T T T NT. Assuming both BPB initial prediction is NT.

c) Give an example showing how 2-bit BPB outperforms 1-bit BPB in terms of branch prediction accuracy. Write the actual outcome sequence for one branch instruction. Use T to denote a Taken Branch, NT denotes a Not Taken Branch. For example, you could say a pattern like T T T T T NT. Assuming both BPB initial prediction is NT.

d) Find the worst scenarios for 1 bit BPB and 2 bit BPB respectively.