Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Burst Time ProcesS P1 P2 P3 P4 P5 Priori 2 12 2 The processes are assumed to have arrived in the order P1,P2, P3, P4, P5 all at time 0. Draw Gantt charts illustrating the execution of these processes using First Come First Serve, Shortest Job First, a non-preemptive priority algorithm (a smaller priority number implies a higher priority), basic round robin with a time quantum-3, and feedback queues where there is one queue for each priority, and the priority 1 queue has a time quantum of 3, and each lower priority queue, has a time quantum that is increased by 1. Assume a process is demoted after consuming 3 consecutive time quantum with the feedback queues algorithm a. b. What is the turnaround time of each process for each of the scheduling algorithms c. What is the waiting time of each process for each of the scheduling algorithms in d. Which of the algorithms in part a results in the minimal average waiting time in part a? art a. (over all processes) How would the previous problems be affected if process P6 arrived at time 8, with a priority of 1, and an expected burst time of 3. HINT: a Gantt chart is a linear bar chart, that would show the time that execution began for a process, the "length" of execution, and the "time" that the next process b : IE: egins execution