4. Given the following recursive function and it corresponding helper function that returns the sum of all the elements of an array that are located at even subscripts: int sumEvenElements (int array[], int i) { if (i >= array.length) return 0; return array[i]+sumEvenElements (array, i+2); } int sumEvenElements (int array[]) { return sumEvenElments (array, 0) } Assume n is the length of the array. Find the initial condition and recurrence equation that expresses the execution time for the worst case of the recursive function and then solve that recurrence.