1. Lab 3, you have worked on Quick Sort Algorithm. Modify the Partition algorithm by using the first element as pivot, and complete the program. Also, modify your main function to use random data in the range from 1 to 100 rather than data values are being read using input statement. Must submit the code along with results, and must use at least 50 data to do sorting. Results should be displayed as 10 data per line. 2. Illustrate Quick Sort algorithm to sort the following data. Also compute runtime at each step until done, and add the total. Data Given: 36, 41,9, 30, 45, 8, 18, 22, 20 Must use the following table. I 123456789 Runtime Explanation of Algorithm A[I] 3. Given the following data sets each set containing 8 data as given below: a) 32, 24, 20, 18, 16, 15, 10, 5 b) 5, 19, 15, 16, 18, 20, 24, 32 c) 32, 24, 20, 16, 15, 10, 5, 18 If you implement quick sort in each case, what would be the runtime in each case? 4. A) Build a Max Heap using the following data: 35, 12, 7, 18, 24, 40, 39 Runtime Explanation of Algorithms B) Now show how you would delete the root from this maxheap. You must start from your answer of problem 4. Runtime Explanation of Algorithms 5. Start from the answer of problem 4 (b) and illustrate Heap Sort algorithm. Runtime Explanation of Algorithms