Question 5 (10 Points) Write a well-documented, Python program, hmwk305.py that implements the Selection-Sort algorithm. Selection-Sort segments the list into sorted and unsorted elements. The algorithm continues to remove the smallest element of the unsorted list and adds it to the sorted segment. Implement the algorithm that accepts an unsorted list and returns a sorted one - in ascending order. 5 3 8 Initial List 4 6 18 4 6 Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position: Sorted List Length 2 w 4 5 Minimum Swaps Position: Sorted List Length 3 3 4 5 6 Minimum Swaps Position 3 4 5 6 8 Sorted List Selection Sort Algorithm Hints: Convince yourself that the algorithm and Python implementation is correct by calling the sorting function with a list [50, 20, 10,80,40], and printing the sorted result. Your algorithm should use a while-loop to ensure that the ascending order is achieved. Grading: Comments (+2 points). Input software to query for a list of N elements (+4 points). A correct while-loop (+4 points)