3. (10 points) For each of the following recurrence equations which describe the running time T(n) of a recursive algorithm, use the master method to express the asymptotic complexity (assuming that T(n) = c for n 0 and d>1). (a) T(n) 2T(n/2) + log n (b) T(n)=8T(n/2)+ (c) T(n) = 7T(n/3) + n (d) T(n) = 4T(n/2)+ (e) T(n) = 3T(n/2) +