Suppose that jobs entering a computer system are assigned a job number and a priority from 0 through 9. The numbers of jobs awaiting execution by the system are kept in a priority queue.
A job entered into this queue is placed ahead of all jobs of lower priority but after all those of equal or higher priority.
Write a program that uses alit to store the jobs and allows the user to select one of the following menu options: R(remove), A (add), or L (list).
For R, read a job number and remove it from the priority queue; for A, read a job number and priority and then add it to the priority queue in the manner just described; and for L, list all the job numbers in the priority queue.