Consider the Code Static Void DoQuickSort(int Array[ ],Int Start,int End)

Consider the code
Static void doQuickSort(int array[ ],int start,int end) {
Int pivotPoint;
If (start < end) {
PivotPoint = partition(array,start,end) ;
DoQuickSort(array,start,pivot-1) ;
DoQuickSort(array,pivot+1,end) ;
}
}
In this code,the value pivotPoint returned by partition

A) is the value of the array element that is greater than each element of the first sublist,and less or equal to each element of the second sublist
B) is the position of the array element that is greater than each element of the first sublist,and less or equal to each element of the second sublist
C) is the element X such that half the elements of the array are less than X,and half the elements of the array are greater or equal to X
D) None of the above