6. (a) A Minimum Priority Queue is a collection that supports inserting an element and deleting the minimum element from the collection. Point out the changes in the implementation of the helper functions svim and sink presented on slides 8 and 10 of C2P3.pdf to support the insert and delMin operations. Comment on whether you need to modify the existing insert and delMax operations for the Max.Priority Queue discussed in the textbook. If so, provide the changes. [3 marks) (b) How would you use the minimum priority queue to perform heapsort? For this question explaining in a few lines will suffice. No need to give implementa- tion/code. [3 marks) 6. (a) A Minimum Priority Queue is a collection that supports inserting an element and deleting the minimum element from the collection. Point out the changes in the implementation of the helper functions svim and sink presented on slides 8 and 10 of C2P3.pdf to support the insert and delMin operations. Comment on whether you need to modify the existing insert and delMax operations for the Max.Priority Queue discussed in the textbook. If so, provide the changes. [3 marks) (b) How would you use the minimum priority queue to perform heapsort? For this question explaining in a few lines will suffice. No need to give implementa- tion/code. [3 marks)