Assume each expression listed below represents the execution

Assume each expression listed below represents the execution time of a program. Express the order of magnitude for each time using big O notation. T(n) = n^3 + 100n times log_2 n + 5000 T(n) = 2^n + n^99 + 7 T(n) = n^2 - 1/n + 1 + 8 og_2n T(n) = 1 + 2 + 4 + ... + 2^n-1

Solution

Answers-

The Big-O Notation\'s Order of magnitude is the one with the highest power (because they are, in most cases, the most computationally expensive function). So, you will have to see, in your formula, which function is most computationally expensive to do.

A) O(N^3)

B) O(2^N)

C) O(N^2)

D) O(2^N-1)