As discussed inour video lecture, selectionsortis a simple sorting algorithm that works by repeatedly finding the minimum element from unsorted part and putting it the sorted portion of the list, soin every pass of selection sort, weput the minimum element from the unsorted subarray in the proper place in the sorted portion of the list. write the function selectionsort(numlist) that takes an unsorted list of numbers and uses the selectionsort algorithm to returnthe sorted list.