Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. In addition to the processes listed below, the system also has an idle task $($which consumes no CPU resources and is identified as Pidle $).$ This task has priority $0$ and is scheduled whenever the system has no other available processes to run. The length of a time quantum is $10$ units. If a process is preempted by a higher$-$priority process, the preempted process is placed at the end of the queue.