Questions: 1. 994385934n5 + 150n4 + 5n3 + 4n² + n +8 2. nlog(n) + log(n) 3. log log(n²) + log(n log n) + log² log(n) + log log² (n) Answers: 3. O(n log n) 4. O(log² log(n))

Not an exam. Just review for me.

For each function f(n) below give an asymptoic upper bound using big-Oh notation. You should give the tighest bound (ie. smallest bound) possible and simplify the expression.  Explain step by step how you your answers. Use signma notation to prove your answers if you can  

I attached the answers for question 3 and 4 for your reference so you can check your work but explain how you got those answers.  I dont have the answer key for 1 so please try your best on that.