Q5. Spot the error in the following code that is supposed to sort the list t and print it? How would you fix it?  t = [6, 3, 9, 1] t = t.sort()  print(t, type(t))

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,…

7) Use a counting sort on a set of keys that fall between (a, b), where a and b are modest positive numbers that the user inputs. 8) For an acceptable selection of the number of buckets, implement bucket sort with an array of lists data structure to sort a list of characters, a list of floating point values, and a list of uniformly distributed integers.

(Note: Do not read input, instead use the arguments to the function. Do not print the output, instead, return values as specified. No loop, while, for, if, etc.) Write a function in f#, negate xs, that takes an int list xs and returns a list of all the elements negated. Example:negate [0;1;-3;2;-5]val it : int list = [0;-1;3;-2;5]