You have the following processes with Priority, Arrival and Burst Time. Apply all scheduling algorithms and check which algorithm is best. Process P P P3 PA Priority 40 30 30 35 5 10 Burst 20 25 25 15 10 10 Arrival O 25 30 60 100 105 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. a. Show the scheduling order of the processes using a Gantt chart. b. What is the turnaround time for each process? c. What is the waiting time for each process? Activate Wir