Assignment:
Solve the recurrence T(n) = 2T(sqrt(n)) + 1 by making change of variables. The solution should be asymptotically tight.
Use a recursive tree to give an asymptotically tight solution to the recurrence T(n) = T(n-a) + T(a) + cn, where n > = 1 and c > 0 are constants.
Provide complete and step by step solution for the question and show calculations and use formulas.