Problem E. Consider the following set of processes, with the length of the CPU burst given in milliseconds, the processes are assumed to have arrived in the order Pi, P2, Ps, Ps, Ps, all at time 0. Process Burst Time Priority 4 Ps1 Ps 7 Ps 4 3 Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, a. nonpreemptive priority (a larger priority number implies a higher priority), and RR (quantum 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the waiting time of each process for each of these scheduling algorithms? (hint: if a running process is preempted and sent d. Which of the algorithms results in the minimum average waiting time (over all processes)? Problem F. Consider the following set of processes, with the length of the CPU burst given in milliseconds, (hint: for questions b, c, d, and e as below, NOT all processes arrive at 0 and the turnaround, waiting, or response clock starts at when each process arrives.) Process Priority Burst Time Arrival 15 20 P2