Hi, any hints for solving this question? these are for program correctness

10. Consider the following generalization of the min function. 1 def extract (A, k): 3 # Use partition from quicksort 5 if len(L) -1: pivot -A(8] L, G = partition (A[1",len(A) -1), pivot) return pivot 7 else if len (L) k 8 return extract(L, k) 9 else: return extract(G, k en(L) -) (a) Prove that this algorithm is correct. (b) Analyse the worst-case running time of this algorithm. Hint: this algorithm is known as quickselect, and is pretty obviously related to quicksort