6. What are the Big-Oh orders of the following growth functions? You should provide a relatively tight upper bound. [2 points] fi(n) = 100 + 10logio (n)n + 45n f2(n)=nlogio(n) + nlog (n) 7. Show that the upper bound you give for fi 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]