pls help

1. CPU Scheduling. Draw Gantt charts for the following set of processes using different scheduling algorithms: (a) SRT, (b) Priority with preemption (Linux convention), (c) Priority with preemption (Windows convention), (d) RR with quantum Q = 3, and (e) RR with quantum Q = 2. Let us assume the standard tie-breaking rules when multiple processes are eligible, i.e., the process with smaller ID will go first. Compute the waiting time and turnaround time for each process under the algorithms (a) to (e). Process Burst Time Arrival Time Priority P1 P2 P3 P4 2 PS 7 5 9 0 4 5 1 2 4 3 1 1 9 5 Response time measures the time taken for the first response of a process. However, response time does not always provide a good measure for the responsiveness of interactive processes since it only measures the time taken for the first response. Waiting time is a useful measure for system performance too, but normally we just measure the total waiting time for a process by adding up all the waiting periods. The first waiting period is normally more important, as it measure the response time at the beginning of a process. As execution continues, subsequent waiting periods are not as much as a concern. Here, let us take a weight on each waiting period and add them up, instead of simply adding them up in our normal total waiting time computation. In summary, assume that a weighting factor w is adopted. The first waiting period will take a weight of 1, the second period a weight of w, the third period a weight of w?, the fourth period a weight of w?, and so on. The resulting waiting time would be the total weighted waiting time. If w= 1, this is the same as the total waiting time, and if w