Find algorithms whose time complexities are described by given recurrence relations

Question

I have to solve some recurrence relations (for n=2^k) and find algorithms whose time complexities are described by these relations.

1.

T(1) = 0
T(n) =