Explain the formal mathematical definition of Big O notation using limits and quantifiers. Specifically, provide the definition where f(n) = O(g(n)) if there exist positive constants c and n0 such that 0 <= f(n) <= c*g(n) for all n >= n0. Discuss the significance of this notation in analyzing the upper bounds of algorithm efficiency and why it is considered an asymptotic analysis.