- Please solve these questions and provide a in depth explanation for both. Thank you.

2. Solve the recurrence T(n)=2T(n)+logn. Hint: Let S(k)=T(2k) and write a divide-and-conquer recurrence for S(k) 3. Use a recursion tree to show that the solution of T(n)=T(n/3)+T(2n/3)+n is T(n)=(nlogn)