Analyze scheduling algorithms for the following five processes given the process CPU burst time, priority (lower number means higher priority) and arrival time.

For each of the following scheduling algorithms draw a Gantt diagram, calculate, and show clearly, the total wait time for each process, and calculate the average wait time.

a) First Come First Served (FCFS) (Arrival times should be considered.)

b) Non-preemptive Shortest Job First (NP-SJF)

c) Preemptive Shortest Job First (P-SJF)

d) Preemptive Priority Scheduling

e) Non-preemptive Priority Scheduling

f) Round Robin Scheduling (Assume that the time quantum is 4 time units). Also assume that if a new process arrives at exactly the same time as the time slice of the executing process expires the executing process is put at the end of the ready queue after the arriving process.

*Note: Arrival Times should be considered for each of the scheduling algorithms. Its possible that a given algorithm will not need all the information given in the table.

Priority Burst Time 14 Processes P1 P2 P3 P4 P5 2 1 5 4 Arrival Time 0 2 4 6 12 4 16