1. Fill in the blanks to complete the following recursive function:

 2. Which is the base case and which is the general case? 3. Show how you would call this function to sum all the elements in an array called numbers, which contains elements indexed from 0 to MAX_ITEMS - 1. 4. What run-time problem might you experience with this function as it is now coded?

Transcribed Image Text:

int Sum(int info[], int fromIndex, int // Computes the sum of the items betwee // toIndex. { } if (from Index return else return toIndex)