IDNLearn.com is your go-to platform for finding reliable answers quickly. Discover prompt and accurate answers from our experts, ensuring you get the information you need quickly.

This is the solution of finding the time complexity of a recursive problem using the method of substitution . I am not understanding the last two lines o solution. How did the solution end up as O(2²ⁿ). Please explain in details