Can someone help solve this recurrence relation? [closed]

Answer 1

Most of the time the best way to deal with recurrence is to draw the recurrence tree and carefully handle the base case.

However here I will give you slight hint to solve using substitution method.

In recurrence first try substitution n = 2^k In recurrence second try substitution n = 2^2^k