Notes: All functions in this homework map R+R+ The italics before a question provide motivation for the question for you to think about. You do not need to respond to the italicized prompt. Provide tight bounds on a function in asymptotic notation. (10 points) Show that n4-15n3 + 2n2 + 8--(n4) 1) Which is better an algorithm that runs in exponential time or an algorithm that runs in factorial time? Hints: 1) You will want to use the definition of big Theta to show both upper and lower bounds