java code

This project will involve implementing a priority with round-robin scheduling algorithm, which schedules
processes in order of priority and uses round-robin scheduling for processes with equal priority. Priorities
range from 1 to 10, where a higher numeric value indicates a higher relative priority. For round-robin
scheduling, the length of a time quantum is 4 milliseconds. It is assumed that all processes arrive at the
same time, so your scheduler algorithms do not have to support higher-priority processes preempting
processes with lower priorities contact for more details .