python 3

Problem Implement a recursive Selection Sort. You will not receive any points for this assignment if you implement an iterative algorithm. Remember, Selection Sort selects the smallest element from the unsorted array, and places it in the front (or between the sorted and unsorted boundary of the array). You may also re-use your code for the Index of Max assignment of this week. The array should be sorted in ascending order.