Question $5$ of $5$

In the context of algorithm analysis, what does the term "Big O notation" specifically represent?

The average$-$case running time of an algorithm

The exact running time of an algorithm for any input size

The minimum space requirement of an algorithm

The lower bound on the running time of an algorithm

An upper bound on the running time of an algorithm