Divide-and-conquer:

(a) Design a divide-and-conquer algorithm DC_MAX that receives as input an array A with n integers and returns the maximum of the elements in A.

You may assume n is a power of 2.

(b) Use divide-and-conquer methodologies to find the recurrence relation for the running time, T(n), of DC_MAX.

(c) Use the Master Theorem to give a tight bound for T(n).