(a)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)

{

}

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