1. Using quicksort, sort the following array and show the required steps. 16 2 3 5 77 28 10 1 21 33

2. Build a Max-Heap with the following array. 12 45 8 38 22 1 56 73 14 17 69

3. Using heapsort, sort the following array and show the required steps clearly. 16 2 3 5 77 28 10 1 21 33