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- lo; for( int i=10+1 ; & x) f qsort (x, 0, x.sizeO-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, o, 3) on the input shown below: 10-0 1 2 hi-3 4 5 6 iaddbedace baa cabdad ebb bee cab dadebb bee cab dadebb bee cabdadebb bee cab dad ebb after swap (x[lo],xp] 52 1 at the end of iterationi-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) xl (B) x[ 1