Sum(log(n!)) Big(O) notation and graphical properties

499 Views Asked by At

For the computation of the run time/big O notation of sum(log factorial), i.e., $\sum(\log(n!))$, is the Big(O) run time for this $O(n^2)$?

Why is that?