<prompt> Theha algorithm ho hlophisa palo ea linomoro ho tloha tlase ho ea holimo3,7,2,4,9  <response>: Instruction in English: Create an algorithm to arrange a set of numbers from lowest to highest . Response in English: One common algorithm to arrange a set of numbers from lowest to highest is called the Bubble Sort algorithm. It works by comparing adjacent numbers in the list and swapping them if they are in the wrong order. This process is repeated until the entire list is sorted. Here is an example of how the Bubble Sort algorithm could be implemented:pythondef bubble_sortnumbers: n lennumbers We need to do n-1 passes for i in rangen - 1: Last i elements are already in place so we dont need to check them for j in range0, n - i - 1: Swap if the element found is greater than the next element if numbersj numbersj 1: numbersj, numbersj 1 numbersj 1, numbersj return numbersmy_list 3, 7, 2, 4, 9printUnsorted list:, my_listbubble_sortmy_listprintSorted list:, my_list Output:Unsorted list: 3, 7, 2, 4, 9Sorted list: 2, 3, 4, 7, 9 . Response in Sesotho: Algorithm e ngoe e tloaelehileng ea ho hlophisa palo ea linomoro ho tloha tlase ho ea holimo e bitsoa Bubble Sort algorithm. E sebetsa ka ho bapisa linomoro tse haufi lethathamong le ho li fapanyetsana haeba li le ka tatellano e fosahetseng. Tsebetso ena e phetoa ho fihlela lethathamo lohle le hlophisoa. Mohlala ke ona oa kamoo algorithm ea Bubble Sort e ka sebelisoang kateng: python def bubble_sortlinomoro: n lenlinomoro Re hloka ho etsa n-1 pass for i in rangen - 1: Lielemente tsa ho qetela li se li ntse li le teng kahoo ha ho hlokahale hore re li hlahlobe bakeng sa j ka hara mefuta 0, n - i - 1: Fapanya haeba element e fumanoeng e le kholo ho feta ntho e latelang haeba linomoroj linomoro j 1: linomoroj, linomoroj 1 linomoroj 1, linomoroj khutlisa linomoro my_list 3, 7, 2, 4, 9 printLenane le sa hlophisoang: , my_list bubble_sortmy_list printLenane_le hlophilwe:, lenane_laka Sephetho: Lethathamo le sa hlophiswang: 3, 7, 2, 4, 9 Lethathamo le hlophilweng: 2 , 3, 4, 7, 9 