USING THE INFORMATION ABOVE ANSWER THE QUESTION BELOW

Give an expression, T(n), for the running time of part(A, L, r) using the example partitioning as motivation; assume n = r L + 1. Explain your answer. In case it is not clear, I want both T(n) = , and I some some words here explaining why your expression for the running time of part makes sense. Nothing fancy; my solution consists of one sentence.

2: 3: 3: pk l 4: 5: 5: 6: 6: 7: 8: 7. Consider the QUICKSORT "helper algorithm PART: 1: algorithm QUICKSORT(A, l,r) 1: algorithm PART(A, l, r) 2: if l