Homework2C54252 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