1. Consider the following set of processes, with only 1 CPU burst. The length of the CPU-burst time given in some unit t: Burst Time (t Process Prioritv Pl P2 P3 P4 P5 10 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0 a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority (a smaller priority number implies a higher priority), and RR (quantum = It) scheduling. b. What is the turnaround time of each process for each of the scheduling algorithms in part a