How can I solve this Big $O$ exercise?

Question

How can I prove that $n \log_2(n) ∈ O(log(n!))$ is true?

We start by supposing that $f(n)< c g(n)$ is true,

which means that $n \log_2(n) > c \log(n!)$ for all $n>n_0$ and $c>0$.