<prompt> 25, 32, 10, 17, 9Kuandika code ili kupanga safu fulani katika mfuatano wa kuongezeka.  <response>: Here is a simple implementation of a sorting algorithm in Python, specifically the Bubble Sort algorithm. Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.pythonarray 25, 32, 10, 17, 9def bubbleSortarr: n lenarr Traverse through all array elements for i in rangen-1: for j in range0, n-i-1: Swap if the element found is greater than the next element if arrj arrj1 : arrj, arrj1 arrj1, arrjbubbleSortarrayprint Sorted array is: , arrayOutput: Sorted array is: 9, 10, 17, 25, 32 