Problem Solving: Read the following questions carefully and answer what is asked. (20marks) Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: Process Arrival Time Burst Time P1 0 5 P2 2 3 P3 3 2 P4 4 4 P5 5 3 a. Draw Gantt charts illustrating the execution of these processes using SJF (pre-emptive and non-preemptive) & RR (Quantum = 3) scheduling Marking scheme: (15marks=5 marks for each algorithm) b. What is the waiting time of each process for each of the scheduling algorithms in part a. (3marks) C. Evaluate the performance of pre-emptive and non-pre-emptive and Round Robin approaches in operating systems based on the average waiting time. (2marks)