Consider the following processes with the corresponding arrival time, burst time and priority. Q1- Draw the corresponding Gantt diagrams for this scheduling algorithms; - First Come First Served. - Non-Preemptive Priority. - Preemptive Priority. - Round Robin q=1 (1ms Quantum). Q.- Calculate, for each applied scheduling algorithm, the average waiting time and average turnaround time. Q.- Based on the values obtained in question " Q2 ", what is the best applied algorithm. Q. Explain how the starvation problem can occurs using the Preemptive Priority algorithm