Do the same as in Exercise 12.1 but produce a recursive call tree when sorting the values in…

Do the same as in Exercise 12.1 but produce a recursive call tree when sorting the values in ascending order.

Exercise 12.1:

Given the following sequence of keys (80, 7, 24, 16, 43, 91, 35, 2, 19, 72), trace the indicated algorithm to produce a recursive call tree when sorting the values in descending order.

(a) merge sort

(b) quick sort