<prompt> Kuandika kazi ya kutekeleza uteuzi mpangilio.  <response>: Selection sort is a simple comparison-based sorting algorithm. Heres an implementation of the selection sort algorithm in Python:pythondef selection_sortarr: for i in rangelenarr: Find the minimum element in unsorted part of array min_idx i for j in rangei 1, lenarr: if arrj arrmin_idx: min_idx j Swap the found minimum element with the first element of the unsorted part of array arri, arrmin_idx arrmin_idx, arri return arrThis function takes a list of numbers arr as an input and sorts it in ascending order using the selection sort algorithm. The outer loop runs from the first element to the last element of the array. Inside the outer loop, we find the index of the minimum element in the unsorted part of the array. Then, we swap the minimum element with the first element of the unsorted part of the array. As a result, after each iteration of the outer loop, the smallest element of the unsorted part of the array is placed at the beginning.You can use this function to sort a list of numbers like this:pythonarr 64, 25, 12, 22, 11sorted_arr selection_sortarrprintsorted_arrThis will output the sorted array:11, 12, 22, 25, 64 