write program in c++programming language...plz solve it in 60 minutes....

There are N printing jobs in a queue to be done, and each job has its own priority. The job with maximum priority (less number of pages) will get completed first than others. At each instant you are completing a job with maximum priority and at the same time you are also interested in adding a new job in the queue with its own priority. Keeping in mind, maximum number has maximum priority, consider the array to perform following operation in data structures. 30 12 47 32 25 92 57 63 71 89 a. Delete the job with higher priority using circular linked list b. Sort this printing jobs from higher to lower order using recursion. Thinking recursively, find the min value, either the first value in the list or rest of the list, whichever is smaller. If the list only has one integer, then the single value is minimum