CodeWorkoutX263: Recursion Programming Exercise:LargestWrite the missing base case for function largest.Function largest should find the largestnumber in array numbers.When largest is first called, index will equal numbers.length-1.Examples:largest({2, 4, 8}, 2) -> 8Your Answer:1 public int largest(int[] numbers, int index) {if <>return numbers[0];return Math.max(numbers[index], largest(numbers, index-1));5}4

Given question is about recursion which is basically a situation where a function is called automatically on its own until it reaches the base condition. The given program is about finding largest element out of all the elements of the array using recursion.Answer involves two functions namely largest and main where the former finds largest of the elements of an array using recursion and returns it to the latter function which is the driver function of the program. The largest() function is called from the main() function. The base condition that was missing from the program is (index==0). Adding it in the program in the if clause returns the correct answer. Array that is used is already initialized and its size has been found using the sizeof() operator. Program Code: #include<iostream> #include<Math.h> using namespace std; int largest(int numbers[], int index) { //Base condition if(index==0){ return numbers[0]; } //returns maximum element of the passed array return max(numbers[index],largest(numbers,index-1));//returns maximum element of the passed array } int main() { //Array declaration and initialization int arr[]={23,45,67,12,89,47}; //Calculating size of the array int n=sizeof(arr)/sizeof(arr[0]); //Calling largest function with array and index of last element cout<<"Largest number: "<<largest(arr,n-1); return 0; } Code Screenshots: