CSc 7132 Operating System & Networking 7. (20 points) Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. Also the priority for each process is provided. Arrive time Burst time Process P1 P2 P3 10 Draw for Gantt charts illustrating the execution of these processes using a. i. FCFS ii. Pre-emptive SJF ii. Non pre-emptive SJF b. What is the waiting time of each process for each of the scheduling algorithms in part a? hat is the average waiting time of each process for each of the scheduling algorithms in part a? You can fill the answers in the following table for b. Waiting time FCFS Pre-emptive SJF Non pre-emptive Process P1 P2 P3 Ave Waiting SJF time Which of the scheduling in part a results in the minimal average waiting time (over all processes)? c