Already solved a b c, but stuck on d and e, detailed process please.

CPSC 221 Winter 2, 2018 1. Three Pile Radix Sort-42 points] 1.1 Quicksort In practice, quicksort is one of the fastest sorting algorithms. 1. Pick a pivot (e.g. the first element) 2. Reorder the array such that all elements & x, int lo, int hi) f if (lo >=hi) return; int p 10; for( int i-10+1; i & x) f gsort (x, , x.size()-1); (a) (4 points) Show the contents of the array x at the start of each iteration of the for-loop in the call qsort(x, 0, 3) on the input shown below: 1o-01 2 hi-3 4 6 iadd bed ce baa bee cab dad ebb bee cabdad ebb bee cabdad ebb bee cabdad ebb bee cabdad ebb 2after swap(xlo],x [p]) 1 at the end of iteration-3 (b) (4 points) Complete the following loop invariant by providing the range of indices for which the statement is true. Note that x[a b] is empty if a >b. At the start of iteration i of the for-loop in qsort: (A) x (B) x 1