3. The deadline to submit the answers is 11:59 pm on Feb 26, 2023 Consider the foll ing set of processes, with the length of the CPU burst time given in milliseconds: The processes are assumed to have arrived in the order P1,P2,P3,P4,P5 all at time 0 . a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, priority queue, and RR (q=2). b. What is the waiting time of each process for each of these scheduling algorithms? c. Which of the algorithms results in the minimum average waiting time (over all processes)