
Give an asymptotic upper bound for T(n) satisfying the following recur- rence. Make your bound as tight as possible. You must prove this bound from scratch (either using the expansion method or the tree method). You may assume n is power of 3.
PayPal Gateway not configured
PayPal Gateway not configured