Calculate T(n) and O(n) for the following algorithms (Quick Sort) for the average and worst case: void quick-sort (int first, int last, std::vect or 1) I //There is data to be sorted. /Partition the table. int pivot-partition (first, last,arr); quick_sort (first, pivot,arr); quick sort (pivot 1, last,arr) //Sort the left half // Sort the right half. int partition (int first, int last, std::vector