computer science, algorithms design.

please show steps, Thank you!

(please use the template to help me finish this question, thank you very much

**********************************************************************************************************************************************************************************************************************************************************************************************************************************************************

#include  #include  // add your head files here and please do not change the existing head files using namespace std; /* Write a source code of the implementation of Divide and Conquer method of sorting a set of 20 positive integers in ascending order using (a) merge sort method, (b) quick sort method. There will be 7 test cases for each method and each test case worth 1 point. Please use the template to finish this question or you will get 0 point. */ class Solution { public: vector quick_sort(vector unsorted_list) { vector sorted_list; /* requirements: Apply quick sort method to the unsorted list. input: An unsorted list, for example, [3,5,2,1] output: A sorted list in ascending order, for example, [1,2,3,5] */ // insert your codes here // end here return sorted_list; } vector merge_sort(vector unsorted_list) { vector sorted_list; /* requirements: Apply merge sort method to the unsorted list. input: An unsorted list, for example, [3,5,2,1] output: A sorted list in ascending order, for example, [1,2,3,5] */ // insert your codes here // end here return sorted_list; } };

**********************************************************************************************************************************************************************************************************************************************************************************************************************************************************

Please check the following requirements:

1. Please do not change the file name

2. Please do not change the file type

3. Please follow the comments in the file

4. Please do not change the function signature (existing function names, arguments, and so on)

5. Please do not return the hard-coded value directly. Or it will be considered an incorrect implementation.

6. The running time is limited to 600 seconds. It should be enough, or you may need to optimize your solution.

5. [14 points] Write a source code in either Python or Java or C/C++, implementing the Divide and Conquer method of sorting a set of 20 positive integers in ascending order using (a) merge sort method, (b) quick sort method. There will be 7 test cases for each method, each worth 1 point. Please use the template to finish this question, do not change the filename and existing code, or you will get 0 points