In this exercise, we want to verify computational rules involving the asymptotic big-O notation. a) Show that (1 + O(x)) (1+ O(x)) = 1+O(x) for x - 0. The precise meaning of this statement is that if f is a function satisfying f(a) = (1 + O(x))(1+ O(x)) as r - 0, then f also satisfies f(x) = 1 + O(x) as r - 0. b) Verify that (1 + O(x)) = 1+O(x) for r - 0. Hint: The formula for the geometric series, Cle,* = for |r|