Lecture 15 - Example 2 Backward Substitution

This is Lecture 15 of the series of lectures on algorithms. In this video, I have taken a recurrence relation as an example to be solved using the Backward Substitution method.
In this series, we will study topics like
1. Finding the Time complexity of an algorithm (loops, recursive) using the counting method, tree method, and recurrence relation.
2. Algorithms paradigms ( Divide and conquer, greedy, dynamic programming, backtracking, etc..)

Hope you will enjoy it!!!
Thanks