Algorithms

Am I right for the first question? And I need help with the other questions

7-10 Short Answer: Analysis of Algorithms [10 points upper bound. [2 points) 2(n)nlogho(n) +nlog2(n) 6. What are the Big-Oh orders of the following growth functions? You should provide a relatively tight 7. Show that the upper bound you give for Ji above does indeed hold. [2 points 8. Assume you have two algorithms A and B. A is O(n), and B is O(n?),. Will the algorithm A always run faster than algorithm B on real-world inputs? Explain. [2 points