Computer Science "Asymptote"

QUESTION 1 1 points Provide a bound for the following function in its simplest form: 2n + log(n) + 1000 Enter your answer here QUESTION 2 1 points When determining a bound on the runtime of a program, would saying it is in O(N) or saying it is in (N) be more descriptive of the actual runtime? O O(N) (N) QUESTION 3 2 points Wh f(N)-1-2 + 4 + 8 + 164 at is the bound on the following function: where the function is the summation of the powers of 2 less than N Enter your answer here