prove that height of a binary tree with n leaves is

?

at level 0 we have 1 leaf

at level 1 we have 2 leaves

etc..

so the sum is

and

and futher more

first question:

what formula did they use to calculate the sum

(i have here q>1)

?

second question:

i know the definition of \Omega

it means that our x is lagrer equal to C*log_{2}n

means that x is bounded by to functions

i cant see how they got to the conclution that and futher more

?