Define a solution for this recurrence equation using the Master's theorem: T(n) = 2T(2n/5) + nlg n, with f(n) = n*lg(n), n > 1. In the solution, assume that the f(n) term is given by f(n) = n for two cases a = 1 and a = 2. Give the general O solution for T(n) after analyzing the two polynomial cases that were referred to