3. Draw the recursion tree when n=12, where n represents the length of the array, for the following recursive method: int sumsquares (int[] array, int first, int last) \{ if (first == last) return array[first] * array[first]; int mid = (first + last) / i; return sumsquares (array, first, mid) + sumsquares (array, mid +1, last); \} 4. Using the recursive method in problem 3 and assuming n is the length of the array. - Modify the recursion tree from the previous problem to show the amount of work on each activation and the row sums. - Determine the initial conditions and recurrence equation. - Determine the critical exponent. - Apply the Little Master Theorem to solve that equation. - Explain whether this algorithm optimal