which one of these algorithm take more time?

Question

I have these algorithm and I didn't find out which one takes more time.

O((n^2)*log(n))

O(n*(2^n))

I calculate the log of those but I can't understand which one takes more time.

log((n^2)*log(n)) = 2log(n)+log(log(n))

log(n*(2^n))=log(n)+n*log(2)

Answer 1

The second one, because:

2^n > n^2

and

n > log(n)