For each of the four CPU scheduling algorithm: First Come First Serve, Shortest Job First, Shortest Remaining Time First, and Round Robin, you will compare and contrast these algorithms. For each scheduling algorithm using the following CPU scheduling example: 1. Generate the Gantt Chart. 2. For each process, compute its: A. Turn around time. B. Waiting time. C. Response time. 3. Compute, to 2 decimal places: A. The average turnaround time. B. The average waiting time. C. The average response time. The Exam 2 Document contains a table for each scheduling algorithm for you to fill out. CPU Scheduling ExampleProcess Arrival Time Burst LengthP1 22 18P2 4 6P3 16 10P4 2 32P5 10 17For the Round Robin scheduling algorithm, the time quantum is 10. For each of the four CPU scheduling algorithms above, describe the advantages and disadvantages of the algorithm. It is perfectly acceptable for you to research this information using any sources both online and/or offline. Of course, don’t just copy and paste text from the source; write it in your own words. In addition, incorporate results you obtain for the CPU scheduling example in your discussion of the algorithm’s advantages and disadvantages. The maximum exame score is 20.