Sorting

(a) For a given input array A : < 4_a, 1, 5, 8, 2, 6, 4_b, 9, 10 >, what is the sequence of numbers in A after calling Build-Max-Heap(A) ? (please show the intermediate trees).

(b)For a given input array A : < 4_a, 11, 5, 10, 2, 6, 4_b, 9, 7 >, what is the sequence of numbers in A after the first partition (by calling Partition(A, 1, 9))? Note that 1 and 9 in Partition(A, 1, 9) function call are array indexes.

(c)By using the Max-Heap data structure to implement a priority queue, some applications may need to change the data (priority) of a specific node i. That is, given an index i, change the priority of node i to a new priority t. Please write a pseudocode for this procedure.

Max-Heap-update(A, i, t)

{

}

(d) Please describe how to use a priority queue to implement a queue abstract