Use the Priority Queue file and explain how the Insert function works.

Language: C++  Write a Program with Comments for your code to improve quick sort. The quick sort algorithm presented in the ClassNotes-Sorting, it selects the first element in the list as the pivot. Revise it by selecting the median among the first, middle, and last elements in the list.Explain your Outputs or Answers for the following: (C)  Give a list of n items (for example, an array of 10 integers) representing the worst-case scenario. (D)  Give a list of n items (for example, an array of 10 integers) representing the best-case scenario. Please compile your answers in a file including all source code with comments, Explain your running Outputs or Answers in (A) ~(D). Quicksort that was mentioned in the ClassNotes: #include <iostream>using namespace std; // Function prototypesvoid quickSort(int list[], int arraySize);void quickSort(int list[], int first, int last);int partition(int list[], int first, int last); void quickSort(int list[], int arraySize){quickSort(list, 0,…

- Can you please answer this question correctly. Thank you

I need some help with this question.

- Can you provide me with the correct answer - The answer I inputted was 25,33,145,2 but it was shown as incorrect on my homework portal.

(Python)Given an array, construct a BST. Use the BST to find the predecessor q(Largest element, but no larger than q). Here is my code for finding predecessor q after constructing the BST. The problem is when q equals to one of the number in the BST, it does not return that number. For example, an array [47,25,23,81,59] with q = 81 should return 81. My program return 59.