Big O complexity question. Hello, please answer this question in full detail and please tell me why the answer is the correct answer.

Thank you

Question: n + n * log(n^2) + 2 steps

Possible Answers:

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

O(n)

O(n log (n))

O(log(n^2))

None of the above