1. Starting from the initial array B given below perform Quick-sort(B,1,5) and write the resulting array each time a call to Partition
is completed.
B = [5, 4, 3, 2, 1]
2 Assume you are using quicksort to sort array A with 6 distinct elements a1, a2, ..., a6. Draw the portion of the decision tree which corresponds to the ordering a3 < a1 < a6 < a4 < a2 < a5.