Problem 1 (Total 10 Points):

Process scheduling is one of the most important functions provided by an operating system. Consider the following set of processes, with the length of the CPU burst given in milliseconds:

Process	Burst Time	Priority Level
P1	3	2
P2	7	1
P3	11	3

The processes are assumed to have arrived in the order P1, P2, and P3 all at time 0

a. (4 Points) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: First Come First Serve, Shortest Job First, Priority (Note: a small priority number implies a higher priority), and Round Robin (Note: the quantum = 4)

b. (2 Points) What is the turnaround time for each process when Shortest Job First scheduling algorithm is used?

c. (2 points) What is the waiting time for each process when First Come First Serve scheduling algorithm is used?

d. (2 Points) Which of the algorithms results in the minimum average waiting time (over all processes)?

Note: You must show your work for each answer.