1. (25) [Asymptotic upper bound) Show that n000000 = O(1.000001") based on the formal definition of big-0 (see below). It suffices to present the values of c and no and explain how you obtained them. A complete proof (i.e., that it holds for all n no) is not required. Side note: this exercise is showing that an exponential function is always an asymptotic upper bound of (i.e., grows no slower than) a polynomial function. Definition. We say T(n) = o(f(n)) if there exist constants c > 0) and no 20 such that T(n) Sc f(n) holds for all n 2 no