<prompt> Etsa mohlala o le mong oa teko bakeng sa khoutu e latelang.def bubble_sortarr: n lenarr Tsamaea ka hara likarolo tsohle tsa mofuta oa i in rangen: Last i elements are already in place for j in range0, ni-1: transverse the array ho tloha ho 0 ho ea ho ni-1 Fapanya haeba elemente e fumanoeng e le kholo ho feta ntho e latelang haeba arrj arrj1 : arrj, arrj1 arrj1 , arrj khutla arr  <response>: Instruction in English: Create a single sample test case for the following code. . Response in English: A possible test case for the bubble_sort function is:Input:arr 6, 4, 9, 3, 7Output:3,4,6,7,9Test case explanation:The function takes an array of 5 elements as the input. The expected output is the sorted array in ascending order. After passing the input array to the function, the function will compare adjacent elements, swapping them if the left element is greater than the right. This way, in the first pass. 9 the highest value will bubble up to its correct position. The next pass will go up to the second last position and so on. Finally, it will return a sorted array. . Response in Sesotho: Teko e ka bang teng bakeng sa mosebetsi oa bubble_sort ke: Input: arr 6, 4, 9, 3, 7 Output: 3,4,6,7,9 Tlhaloso ea nyeoe ea teko: Mosebetsi o nka lethathamo la likarolo tse 5. joalo ka tlhahiso. Sephetho se lebelletsoeng ke lethathamo le hlophisitsoeng ka tatellano e nyolohang. Ka mora ho fetisa lenane la ho kenya tsebetsong, tsebetso e tla bapisa likarolo tse haufi, e li fetole haeba karolo e letšehali e le khōlō ho feta e nepahetseng. Ka tsela ena, sebakeng sa pele. 9 boleng bo phahameng ka ho fetisisa bo tla puputla ho fihlela boemong bo nepahetseng. Phase e latelang e tla nyolohela sebakeng sa bobeli sa ho qetela joalo-joalo. Qetellong, e tla khutlisa sehlopha se hlophisitsoeng. 