We are going to develop and implement a class PQ (priorityqueue) using the vector STL. The class should work for any datatype that supports the < operator. The class should have thefollowing :
-Two constructors : one is the default constructor which createsan empty vector – the second constructor accepts a vector and sortsit in non-decreasing order.
-An accessor function to return the size of the queue.
-An accessor function to return the front of the list.
-An accessor function to print the entire queue.
-A mutator function to add an element to the queue keeping thelist ordered.
-A mutator function to remove the front of
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured