Please answer this

11. Complete following Quicksort algorithm. (6 points) QS(A, 1, n) if (n>1) x = partition(A, l, n); Partition(Array, s, e)f Pivot = Array[s]; 1 = s; for (j = s+1 to e) {