2. Consider the problem that you are given an integer array A = A[1...n] and you want to compute the average array A. Write divide and conquer algorithm that solves this problem. Your algorithm should divide array into "approximate halves" and compute the average of each "approximate halves" then your "combine should return the exact average. Determine the recurrence relation that expresses the running time of this algorithm