Problem Statement
Consider the following set of processes arriving at a processor. Calculate the average turnaround time if they follow the Preemptive Priority scheduling algorithm. Note: A lower value has a higher priority. Process Arrival Time Burst Time Priority P1 0 7 4 P2 1 3 2 P3 2 1 1 P4 4 3 3 P5 7 2 5 Pick ONE option 6.4 6.8 7.0 7.2 Output Format Print the average turnaround time rounded to exactly one decimal place (for example 6.4 ).