Use Quicksort algorithm to sort the following list of random numbers. Show all steps. Derive the time complexity of Quicksort and find the asymptotic notation using master theorem. [30 points] | 3 | 4 | -2 8 10 5 0 7 12 | 14 9 6 8 1 5 b. Sort the following list of random numbers using Mergesort algorithm. Show all steps. Derive the time complexity of Mergesort and find the asymptotic notation using master theorem. [30 points] | 7 14 2 8 10 5 5 7 12 14 9 6 8 -1 9 c. Build a MinHeap using the following list of random numbers; show the steps. Once the heap is created, show how the heap is stored in memory. Then, delete -1 from the heap and heapify. Show the changed list as stored in memory. [40 points] 11 4 2 8 10 20 0 7 12 14 9 16 8 -1 5 Use Quicksort algorithm to sort the following list of random numbers. Show all steps. Derive the time complexity of Quicksort and find the asymptotic notation using master theorem. [30 points] | 3 | 4 | -2 8 10 5 0 7 12 | 14 9 6 8 1 5 b. Sort the following list of random numbers using Mergesort algorithm. Show all steps. Derive the time complexity of Mergesort and find the asymptotic notation using master theorem. [30 points] | 7 14 2 8 10 5 5 7 12 14 9 6 8 -1 9 c. Build a MinHeap using the following list of random numbers; show the steps. Once the heap is created, show how the heap is stored in memory. Then, delete -1 from the heap and heapify. Show the changed list as stored in memory. [40 points] 11 4 2 8 10 20 0 7 12 14 9 16 8 -1 5