***For C++***

Prompt the user for a priority and a job name (a string), and allow the user to enter a -1 priority to quit entering jobs. Implement a priority queue of maximum length 25. Use priorities ranging from 0 to 10 with the highest priority a 0.

Implement a function to insert a job anywhere in the queue, which must be implemented as a linked list. Do not remove any duplicates; that is, the same job can be entered multiple times with the same or different priorities.

After the user has quit entering priorities and jobs, print out the resulting queue from head to tail.

Also, if you could add comments explaining the functions and variables on how they're used, it would be appreciated!