Consider these algorithms, Fibonacci, binary search, and exponentiation.

For each algorithm, derive and document its time complexity using Big $O$ notation $($Represent the number of instructions with $T(N),N$ is the number of instructions that will be executed$).$

Compare and contrast the time complexities of the chosen algorithms.