7. Given the following divide and conquer 14. Draw the recursive tree a to find the maximum value. ollowing divide and conquer algorithm, and the array a 2, 4, w the recursive tree and determine the number of recursive calls required ive calls required int max (int a[], int i, int r) if(1 == r) return a [1]; int m = (1+r) /2; int u= max (a,l,m); int y = max(a,m+1,r); if (u > v) return u; else return v