Provide the formal mathematical definition of Big-O notation. Explain the theoretical significance of the constants c and n0 in the definition f(n) = O(g(n)). Discuss why Big-O is used to describe the upper bound of an algorithm's growth rate rather than its exact execution time.