Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time 12 P2 Ps Pa 17 a. [4 pts] Draw a Gantt chart similar to one from the lecture notes that illustrates the execution of the processes using the first-come, first-served CPU scheduling algorithm. Assume the processes arrive in the order P, P2, Ps, Ps, all around time 0 ms. b. [4 pts] What is the waiting time of each process? c. 12 pts] What is the average waiting time of the processes