Write a well-documented, Python program, hmwk3Q5.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 3 3 3 3 3 4 4 4 4 8 5 8 5 4 5 5 6 4 6 8 5 6 6 8 6 00 6 8 8 Initial List Minimum Swaps Position: Sorted List Length 1 Minimum Swaps Position: Sorted List Length 2 Minimum Swaps Position: Sorted List Length 3 Minimum Swaps Position 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

please solve this python 3.8.3.

Python’s list method sort includes the keyword argument reverse, whose defaultvalue is False. The programmer can override this value to sort a list in descendingorder. Modify the selectionSort function so that it allowsthe programmer to supply this additional argument to redirect the sort. selectionSort function: def selectionSort(lyst, profiler):i = 0 while i < len(lyst) - 1:minIndex = ij = i + 1 while j < len(lyst):profiler.comparison() # Countif lyst[j] < lyst[minIndex]:minIndex = jj += 1 if minIndex != i:swap(lyst, minIndex, i, profiler)i += 1 def swap(lyst, i, j, profiler):"""Exchanges the elements at positions i and j."""profiler.exchange() # Counttemp = lyst[i]lyst[i] = lyst[j]lyst[j] = temp Use this template in Python to modify the function above: def selection_sort(input_list, reverse):sorted_list = []#TODO: Your work here# Return sorted_listreturn sorted_listif __name__ == "__main__":my_list = [1, 2, 3, 4, 5]print(selection_sort(my_list, True)) # Correct Output: [5,…

Write a Python program to create a list by asking the user the list size and listelements. Remove all duplicates elements from a list. : Let’s the input list is- A= [4, 7, 9, 12, 32, 4, 67, 9], output will be [7, 12, 32, 67]

This program will use an array implementation of a linked list to keep an ascending sorted list of numbers. The input data consists of two fields: a single character and an integer value. The single character gets interpreted as one of the following: A - represents a value that is to be added to the linked listD - represents a value to be deleted from the linked listP - indicates that all values are to be printed in ascending order The character is only used to determine which process is to be executed; it should not be printed, entered into the linked list, or processed in any way. The main program should be mainly function calls. Process input data until end of file. All output should be sent to an output file and be appropriately formatted and labeled. Keep a running log of everything that is going on in the processing. Input file: A 54A -17A 32 A 81 A -30 A 18 P A 41 A 93 A 65 A 80 A 104 A -20 D 81 D 54 D -30 A 79 A 63 A 77 A –33 D 104 D -20 D 80 D 32 P

Heapsort has heapified an array to: 98 71 63 38 16 and is about to start the second for loop. What is the array after each loop iteration? i = 4: Ex: 86, 75, 30 i = 3: i = 2: i = 1: