Part 2 (8 points): Prove that log(i) = O(nlog(n)) HINT: use the formula for geometric sum: = (k+1 1)/(r 1). This is generally a very useful formula.