Create a priority queue class called priQueue derived from the vector class. construct as a template class. priority queue needs to be based on a value from 1 to 10, any element outside the range of 1 to 10 should be given a value of 5.......

..enqueue- should add element to the queue, .......

.dequeue-- should remove element....

peek--return value at front of queue but not remove it.....

.size - returns the number of items in queue.......

.You should create a struct called qElem that will hold both the priority of the element and the data to be put in the queue. The struct should also be of template type so that the value it holds can be of any type. The priority variable type should be an int.

The priQueue class should be derived from vector and should also be a template class so that it can operate on any type. The enque function should be adding a qElem struct so that the data and the prority are coupled. Sorting your queue. You are to create your own sort functionality. Pick any sort that you would like