Proving if equation is $O(\log n)$

Question

How do I prove if

\begin{equation} 2\log(n^{2}\log n) = O(\log n) \end{equation} is true?

I began by trying to find a $C$ where

\begin{equation} 2\log(n^{2}\log n) < O(\log n) \end{equation}

but I can't determine what to multiply $\log n$ by in order to make it greater than \begin{equation} 2\log(n^{2}\log n)\end{equation}

Answer 1

$2\log(n^2\log(n))=4\log(n)+\log(\log(n))<5\log(n)$.