please just the function, not the whole code.

Thank You

C++

Westion 13 Write the recursive selection sort function definition that stay integer of length n. The selection sort function searches they to thind the largest element, then swap it with the last element in the array, then it ca itself(selection_sort) recursively to sort the fest n-1 element of the anay Assume the find_largest function is provided, which returns the pointer pointing to the largest value of the array a of length n. intfind_largest(int *a, int n): Use pointers and pointer arithmetic to process arrays. In other words, eliminate the loop index variables and all use of the operator in the functions. void selection_sort(int *a, int n){ //function returns when the array length becomes 1 if(n== 1) return; l/add your code