COSC 311	Homework #8  	4/2/2013   DUE 4/9/2013

Show the steps to solve for Big Oh from the recurrence

T(n) = 2 * T(n/2) + 1     ==> O(n)
T(1) = 1

Specifically, 
(1) show the first 3 or four steps of 'unwinding' the equality
    (i.e., T(n) in terms of T(n/8)),
(2) show the pattern that you detect in the unwinding,
(3) show what happens when you substitute for n=1,
(4) and solve for T(n) (give the equation for T(n) where the right hand side
    has only T(1) and other terms that are functions of n)