Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P2 7 3 6 3 P4 Ps The processes are assumed to arrive in order Pi, P2, Ps, Ps, Ps all at me 0 1. Draw four charts that illustrate the execution of these processes using each of the following scheduling algorithms (FCFS, SJF, non-preemptive priority (a larger number means a higher priority), and Round Robin with time slice of 2 2. Which of the algorithms minimizes the average waiting time (over all processes)