Implement an ascending priority queue using a (linear) array. The items can be added to the queue like a normal queue. However, the dequeue operation should remove the minimum item from the queue. Once an element is removed from the queue, shift the rest of the elements to the left. A sample run of the program should result in the contents as illustrated in the following Figure. (You do not need the maker ‘front’ for this implementation).

Answer rating: 100% (QA)

Solution CODE include using namespace std struct node int priority int info struct node link class P... View the full answer