Question: T(1)=1, T(n)=T(n-1)+5. solve these recurrence relations by either the forward substitution or backward substitution method. (1) show three expansions so that the emerging pattern is

T(1)=1, T(n)=T(n-1)+5. solve these recurrence relations by either the forward substitution or backward substitution method.

(1) show three expansions so that the emerging pattern is evident. (2) then write out T(n) fully and simplify. (3) demonstrate that your solution is correct by substituting it in the LHS and RHS of the recurrence relation and showing that LHS=RHS.

(4) finally state the complexity order of T(n)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!