Hi,

Could you please help me to solve the question. Also, could you please answer questions in clear hand-writing and show me the full process, thank you (Sometimes I get the answer which was difficult to read).Thanks a lot.

Use the principle of Mathematical induction to prove that when n is an exact power of 2, the solution to the recurrence relation:

Is T(n)= nlog(n)?

2 if n=2, 126) +n if n=2k for k>1