<prompt> Theha lenaneo la ho kenya tšebetsong algorithm ea bubble sort.nan  <response>: Instruction in English: Create a program to implement the bubble sort algorithm. . Response in English: Here is a simple implementation of the bubble sort algorithm in Python:pythondef bubble_sortarr: n lenarr for i in rangen: for j in range0, n-i-1: If the element found is greater than the next element if arrj arrj1: Swap the elements arrj, arrj1 arrj1, arrj Return the sorted array return arr Sample arrayarray 64, 34, 25, 12, 22, 11, 90 Sort the arraysorted_array bubble_sortarray Print the sorted arrayprintsorted_arrayThis code defines a bubble_sort function that takes an array as a parameter. The function uses two nested loops to repeatedly compare and swap adjacent elements until the entire array is sorted. The sorted array is then returned by the function.The sample array is sorted by calling the bubble_sort function and passing the array as an argument. The sorted array is then printed to the console. . Response in Sesotho: Mona ke tsebetsong e bonolo ea bubble sort algorithm ho Python: python def bubble_sortarr: n lenarr bakeng sa i in rangen: bakeng sa j in range0, ni-1 : Haeba elemente e fumanoeng e le kholo ho feta elemente e latelang haeba arrj arrj1: Swap the elements arrj, arrj1 arrj1, arr j Khutlisetsa lenane le hlophisitsoeng la ho khutlisa Sample array array 64, 34, 25, 12, 22, 11, 90 Hlopha sehlopha se hlophiloeng_sehlopha bubble_sortarray Hatisa khatiso e hlophisitsoeng e hlophisitsoenge hlophiloe_e hlophisitsoeng Khoutu ena e hlalosa mosebetsi oa bubble_sort o nkang palo joalo ka paramethara. Tsebetso e sebelisa liloko tse peli tse hahelletsoeng ho bapisa khafetsa le ho fapanyetsana likarolo tse haufi ho fihlela lethathamo lohle le hlophisoa. Sehlopha se hlophisitsoeng se khutlisetsoa ke tšebetso. Mohlala oa sehlopha o hlophisoa ka ho bitsa tšebetso ea bubble_sort le ho fetisa lethathamo e le khang. Sehlopha se hlophisitsoeng se hatisoa ho console. 