(Recursive Selection Sort) A selection sort searches an array looking for the smallest elementin the array. When that element is found, it’s swapped with the first element of the array. The process is then repeated for the subarray, beginning with the second element. Each pass of the arrayresults in one element being placed in its proper location. This sort requires processing capabilitiessimilar to those of the bubble sort—for an array of n elements, n – 1 passes must be made, and foreach subarray, n – 1 comparisons must be made to find the smallest value. When the subarray beingprocessed contains one element, the array is sorted. Write a recursive function selectionSort toperform this algorithm

(Recursive Selection Sort) A selection sort searches an array looking for the smallest element
in the array. When that element is found, it’s swapped with the first element of the array. The process is then repeated for the subarray, beginning with the second element. Each pass of the array
results in one element being placed in its proper location. This sort requires processing capabilities
similar to those of the bubble sort—for an array of n elements, n – 1 passes must be made, and for
each subarray, n – 1 comparisons must be made to find the smallest value. When the subarray being
processed contains one element, the array is sorted. Write a recursive function selectionSort to
perform this algorithm