a. Consider an algorithm with a runtime described by the following function: t(n) = 5 minutes + 7n 2 + ( 3)n seconds where n is the size of the input. Find the simplest f(n) such that t(n) O(f(n))

b. Show that log(n!) (n log n).