There are several cases of divide-and-conquer recurrence relations that are not covered in the master theorem. Nevertheless, the intuition for the master theorem can still give us some guidance. Derive and prove a general solution, like that given in the master theorem, to the following recurrence equation (assuming T(n) is a constant for n less than or equal to a given constant, a ≥ 2): 

T(n) = a T(n/a) + n log log n