04) Consider the following QUICKSORT algorithm that sorts string data. void quicksort (string theArrayint low, int high) int pivotIndex (low high) pivotIndex- partition (cherray, low high) quicksozt (chekrray, low, pivot Index-1) quicksort (chearray pivot Index+, high) a Given an array of state abbreviations FL DE Fill up step by stap the empty boxes below that are supposed to be printed each time the algorithm exits the partition method. Indicate also the pivot used in that partitioning pivot- "DE ivot- pivot Add as many lines as required