1.Suppose we were performing Quicksort on the following array- {94,31,37,52,55,13,57,68,47,82,42,93,11,62,85,65,48,43,27,12} If our initial pivot was 43 . What would thestate of the array be after the initial partitioning(using thein-place partitioning algorithm) 2. Consider the following algorithn(arrays are indexed from 0 to length-1): Algorithm 1 PrefixReversalSort(A) end for Algorithm 2 PrefixReverse (A,k) for I=0 to [k/2] do Swap(A[1],A[ki]) end for Assume the above algorithm comectly sorts the array A. Determine the worst case big. Theta runtime of PrefixReversalSort, and detemnine the configuration of the imput array A which creates this worst case(i.e, the configuration which causes themost operations to occur)