please help as fast as u can

Question1: (6 pts) Find the 10 errors and correct them? (Put underline + red color) # Implementation of Quicksort Def partition (arr, low, high); 1 - (low - 1) pivot = arr[high] for j in range (low, high): # If current element is smaller than the pivot if arr(s) Array to be sorted, # lov --> Starting index, # high --> Ending index # Function to do Quick sort def quickSort (arr, low, high): if low