Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Asymptotic Worst Case Time and Time Complexity Recurrences
If f(n) = 5 f(n/2) + 3 and f(1) = 7 is a recurrence relation where K is positive integer, then f(2K) =
1
5K(31/4) - 3/4
2
5K(29/4)
3
2K(31/4) - 3/4
4
2K(29/4)