<prompt> Kuzalisha algorithm kwa ajili ya kuandaa safu ya integer katika utaratibu wa kushuka.  <response>: Here is a simple algorithm that you can use to sort an array of integers in descending order:1. Start by looping through the entire array, comparing adjacent elements. If the second element is greater than the first, swap them.2. Continue looping through the entire array, performing swaps until the entire array is sorted in descending order.3. You can use a temporary variable to swap the two elements in the array.4. To improve performance, you can use a flag variable to check if any swaps have been made in the current iteration. If no swaps have been made, then the array is already sorted and you can exit the loop.pythondef sort_descendingarray: swapped True while swapped: swapped False for i in rangelenarray-1: loop through the array if arrayi arrayi1: compare adjacent elements arrayi, arrayi1 arrayi1, arrayi swap elements swapped True set swapped to true return array This is a simple implementation of the bubble sort algorithm which can sort an array of integers in descending order. Bubble sort has an average and worst-case time complexity of On2, where n is the number of elements in the array. 