You will also implement a 16-entry branch target buffer organized as a

fully associative cache with FIFO replacement.

The branch target buffer tag is the PC of the branch instruction, and the data

portion is the target address of the branch last time it was calculated.

Entries are put into the BTB only when a branch is resolved and TAKEN.

If you predict a branch to be taken but do not find an entry in the BTB,

fetch (speculatively) from PC+1.

**Deliverable(s)**

1\. Link to your code on Github

2\. Instruction to run and compile the test for branches

Please help me on a tutorial on how I can run and compile the test for branches