QUID: Consider the following set of processes with the length of CPU-burst time given in milliseconds. Draw the Gantt chart illustrating the execution of these processes (by highlighting the blank Gantt chart below) using FCFS, Preemptive SJF, Non-preemptive Priority (a smaller priority number implies a higher priority) scheduling algorithms. In addition, find the average waiting time and average turnaround time for this set of processes under each scheduling algorithm. Good Luck