Give as good a big-O estimate as possible for each of these functions. For the function g in your estimate f(x) ∈ O(g(x)), the function should be much simpler than f. (a) f(n) = (n log n + n 2 )(n 3 + 2)

The second and third function are missing and they are;

The second function; ((2^n) + n^(2))(n^(3) + 3^(n))

The third function is;

(n^(n) + n^(2n) + 5^(n))(n! + 5^(n))

A) O((n^(3)) logn)

B) O(6^(n))

C) O(n^(n)(n!))

Step-by-step explanation:

I've attached explanation of the 3 answers.

is this a multiple choice question?

if so it's a and c

your answer is 228

step-by-step explanation:

add the top and bottom bases together, then divide them by 2, then multiply by the height.