See the following set of processes, with the time required to run in the Burst Time column given in milliseconds.
Process Burst Time Priority

P1. 5 4

P2. 3 1

P3. 1. 2

P4. 7 2

P5. 4 3
Assume that processes come in order P1, P2, P3, P4, P5, at time 0

a. Draw four Gantt charts that illustrate the execution of these processes in turn using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (larger priority number) implies higher priority) and RR (amount of time = 2).
b. What is the turnaround time for each process for each scheduling algorithm in part a?
c. What is the waiting time of each process for each process in each algorithm?
d. Which algorithms result in the smallest average waiting time (across all processes)?