Introduction To Operating Systems Textbook Assignment 1 (5 points) Student Name Student ID number Answer the following Questions: Chapter S: Exercise S.7: Consider the following set of processes, with the length of the CPU burst time given in milliseconds Process Burst Time Priority PI P2 P3 P4 P5 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 pracesses using the following scheduling algorithms: FCFS, SIF, priority la smaller priority number implies a higher priority), and RR (quantum 2) b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the waiting time af each process for each of these scheduling algorithrns? d. Which of the algorithms results in the minimum average waiting time [aver all processesj