can someone help with these

1. Use the Master Theorem to give tight asymptotic bounds for the following recurrences. a. T(n)=2T(n/4)+1 b. T(n)=2T(n/4)+n c. T(n)=2T(n/4)+n d. T(n)=2T(n/4)+n2 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)