For each of the four CPU scheduling algorithm: First Come First Serve, Shortest Job First, Shortest RemainingTime 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. Turnaround 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 Answer Document contains a table for each scheduling algorithm for you to fill out. CPU Scheduling Example:ProcessArrival TimeBurst LengthP12218P246P31610P4232P51017Fo r 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 thealgorithm. It is perfectly acceptable for you to research this information using any sources both online and/oroffline. 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 advantagesand disadvantages.