3. Consider the function f(n) = 50n3 +6n3log(n*)-n log(n2) which represents the complexity of some algorithm (a) Find a tight big-O bound of the form g(n)-n for the given function f with some natural number p. What are the constants C and k from the big-O definition? p, what are the constants C and k from the big- definition? (c) Can we conclude that f is big-e (nP) for any natural number p? (b) Find a tight big- bound of the form g(n) = np for the given function f with some natural number