Argue that the solution to the recurrence , where c is a constant, is by appealing to a recursion tree.

This recurrence is the same one used in the chapter text to show the upper bound. We can easily tweak the proof for the lower bound.

If you have any question or suggestion or you have found any error in this solution, please leave a comment below.