Python

Need Help in English

Thank you

Give an asymptotically tight bound to each of the following expressions:

answers

Example: 3n log n + 2n 0(n log n)

1. 3n^2 + 2n^3
2. 3n^2 + 2^n
3. 3n log n + 2n^2
4. 2^n + 3^n
5. 0.001n^2 + 1000000n

Arrange the following asymptotic family from lower order to higher order. The first has been done for you.

1. 0(n log n)
2. 0(n^3)
3. 0(log n)
4. 0(n^2 log n)
5. 0(n)
6. 0(3^n)
7. 0(2^n)