Start with the definition of the Queue class given in Section 13.2 and modify it to store...

Start with the definition of the Queue class given in Section 13.2 and modify it to store integers instead of characters. A special type of queue is a priority queue. A priority queue behaves like a regular queue except the remove function always extracts the item with the smallest value (this is die item with the highest priority). Create a Priority Queue class that is derived from the Queue class with appropriate constructors. Redefine the remove function in the Priority Queue class to extract the item with the smallest value. Test the Priority Queue class by adding several numbers to a Priority Queue object, then remove each one, printing the removed numbers as they are removed from the queue.