PA of Algorithms Q55

0. When n = 2^2k for some k ≥ 0, the recurrence relation T(n) = √2 T(n/2) + √n , T(1) = 1 evaluates to:

Answer
Comment
Array

Option : A
Explanation :
Given if n = 1 then T (1) = 1
So put n = 1 in all options only option (A) gives 1

Forgot your password?

I agree with the Terms.