Using iteration technique solve the following recurrence relation and derive the BigO run-time. t(n) = 2t(n-1) + c for n>1
t(1) = 1
If you need to write exponent, you can use ^ symbol. For example if you need to write xy, use x^y.
A. What is the value (11-1):
B. What is the value of tín) at 3rd iteration: (Consider the recurrence relation in the question tín) = 2t(n-1) + C is the first iteration):
C. What is the value of t(n) at kth iteration:
D. What is the value of ko:
E. What is the Big O run-time: