def quick_sort(array, low, high):
    if low  high:
        pivot_index = partition(array, low, high)
        quick_sort(array, low, pivot_index - 1)
        quick_sort(array, pivot_index + 1, high)

def partition(array, low, high):
    pivot = array[high]
    i = low - 1
    for j in range(low, high):
        if array[j] = pivot:
            i += 1
            array[i], array[j] = array[j], array[i]
    array[i + 1], array[high] = array[high], array[i + 1]
    return i + 1

array = [1, 0, 2, 9, 3, 8, 4, 7, 5, 6]
n = len(array)
quick_sort(array, 0, n - 1)
print("Sorted array is:", array)

What is the output of the following python program