Implement a recursive C++ function which takes an array of integers (arr) and the starting (start) and ending (end) indices of a portion (part) of this array, and returns the index of the second largest element present in that portion of array arr. The prototype of your function should be: int findSecondLargest (int* arr, int start, int end) For example, the function call findSecondLargest(arr,3,8) should determine and return the index of the second largest element present in the array arr between the indices 3 and 8 (both inclusive)