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