title: Is this statement true and why?(time complexity)
body: <p>I am having a really hard time understanding these so please help me so I may get an example, so I can get a chance to solve more of those. I have tried many different way but none seem to be able to come to a result, my guess is that it is wrong and it is O(n) but I cannot prove it.</p>
  
  <pre><code>//Is this statement true and why? 
   square_root(n5) log(square_root(n5)) = O(n3) 
  </code></pre>