Big O of this function logn + log((n^3) + 1)

Question

I did max(logn , log((n^3) + 1) ) = O(log((n^3) +1)).

May I get verification is correct or not?

log(n^3) is a worser algorithm than logn because n^3 grows faster than n.