I want the code only in c#

HW5-part-2: Parallelization of Quick Sort Due 9/30/2022 No Late Assignment 1- You need to understand the Quick sort algorithm and run the code provided on this handout. 2- Explain what is the time complexity of the algorithm through examples. Change the SEQUENTIAL_THRESHOLD =1000; to 10000 and report the complexity and explain what did you notice and if it is important from Parallelization point of view. Explain why? 3. Is there any other way to improve the Parallelization of quick sort? Quick Sort Algorithm and Its Parallelization The popular Quicksort algorithms recursively partitions the data in two halves based on the pivot element. Quicksort, on average, makes O(nlog(n)) comparisons to sort n items. In the worst-case, it makes O(n2) comparisons, though this behavior is very rare