CPU Priority Scheduling with Round Robin:

Write a Java program to implement a priority scheduling algorithm with round

robin. Your program should first prompt the user to input quantum time $($q$)$

followed by a list of process ID$,$ arrival time, burst time, and priority for each

process to be run on the CPU $(2$ marks$).$ The list is terminated by $0000$ for

the process ID$,$ arrival time, burst time, and priority. The program output

should draw a Gantt chart $($as text, e$.$g$.,0-$p$1-3-$p$3-5-$p$5-9-......)$ that shows

the scheduling order of the processes using the priority with RR scheduling

algorithms $(5$ marks$).$ Also print the turnaround time, response time, and

waiting time for each process along with their average for all processes $(3$

marks$).$ Make sure to display helpful messages to the user for input and output.