Please Show work

For each function below, give an asymptotic upper bound using "big-Oh" notation. Your answer should be as "tight" and simple" as possible a-E(n) = 4n3 + 5n2 log n b. f(n) 3n + 4 log n + 2n O) c?E(n) = 1.611 + n5 d. f(n) = 2 log log n + log(n2) 0(--) o)