how do i complete a function like this ?

Write the recursive selection sort function definition that sorts an array of integer of length n. The selection sort function searches the array to find the largest element, then swap it with the last element in the array, then it calls itself selection sort) recursively to sort the first n-1 cement of the array Assume the find_largest function is provided, which returns the pointer pointing to the bargest value of the array of lengthn. 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 sortinta, int nl function returns when the array length becomes 1 in 1) return l'add your code