Logarithmic series. Lower bound
I am having some trouble, finding the lower bound for this series :

S = lg(n-2) + 2lg(n-3) + 3lg(n-4) + ... + (n-2)lg2.

The upper bound as I have figured out (and I explain below) is O (N^2 . lgN)
Could you help me in finding out the lower bound on this.

My proof for the upper bound goes as :

S = lg [ (n-2)* (n-3)^2 * (n-4)^3 *.. *2^(n-2) ]
  = O ( lg n^(1+2+3+..+(n-1) )
  = O ( n^2*log(n) )
Logarithmic series. Lower bound
===

I am having some trouble, finding the lower bound for this series :

S = lg(n-2) + 2lg(n-3) + 3lg(n-4) + ... + (n-2)lg2.

The upper bound as I have figured out (and I explain below) is O (N^2 . lgN)
Could you help me in finding out the lower bound on this.

My proof for the upper bound goes as :

S = lg [ (n-2)* (n-3)^2 * (n-4)^3 *.. *2^(n-2) ]
  = O ( lg n^(1+2+3+..+(n-1) )
  = O ( n^2*log(n) )