a) (1Opts) Consider the following recurrence: T(n) = 4 T(n/2) + n, for n > 1. Use the Master theorem to compute the solution to this recurrence. b) (1Opts) What is the recurrence function T(n) of the divide-and-conquer algo- rithm used to solve the maximum subarray problem? Use the Master theorem to compute the solution to the recurrence