Problem 3. Let f(n) be a function of positive integer n. We know: We know: f(1)=f(2)==f(1000)=1 and for n>1000 f(n)=5n+f(n/1.01). Prove f(n)=O(n). Recall that x is the ceiling operator that returns the smallest integer at least x