Please answer correctly step by step with explanation

computer science algorithms

Question 4 (3 credits) Observe the following recurrences, use master theorem to solve those that can be solved. For those that cannot be solved directly, try to devise some guess of the solution, and then use substitution method to prove your guess. a) T(n) = 4T + nlgn. b) T(n) = 4T (6) + nvn. c) T(n) =T() + (2) + (6) + n