Give a big-O estimate for f(n) = (n2 n + 3 5 n )(logn! + 5 n ). For the function g in your estimate f(x) is O(g(x)), use a simple function g of the smallest possible order.