4. (12,5 points) Consider the following set of processes, with the length of the CPU burst time given in milliseconds: The processes are assumed to arrive in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four charts, similar to the charts on lecture slides on scheduling, that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority, and RR (quantum = 1). b. What is the turnaround time of each process for each of the algorithms? c. What is the waiting time of each process for each of the algorithms? d. Which of the algorithms results in the minimum average waiting time