c++

(a) Given the following Quick Sort Function, construct the partition function.

(b) What kind of split is the best case for Quick Sort partition? (One sentence)

(c) Draw a recursion tree and use log algebra to derive and compute the total running time for the Best Case of Quick Sort

assuming every level of partition is in the best case (require calculation)

// This program demonstrates the QuickSort Algorithm. #include using namespace std; /1 Function prototypes void quickSort(int [, int, int); int partition (int [, int, int); void swap(int &, int &) int main() const int SIZE = 10; // Array size int count; int array [ SIZE] = {7, 3, 9, 2, 0, 1, 8, 4, 6, 5); Loop counter // Display the array contents. for (count 0; count