please make sure check all 3 of the images they are part of each other. its 1 full question. please help me answer this by step by step explanation. thank you . will appreciate it.

3+4+5=15/5=3) 3. Average wait time must be fully explained (e.g. 1+2+3+4+ 5=15/5=3) 4. Submitted this completed document to Webcourses. 1. Consider the arrival and burst time of five jobs specified in the table below. a. Apply the First Come First Serve (FCFS) operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. c. Generate a Gantt chart to show how/when each process is executed. d. Calculate the average turn around time of the processes. e. Calculate the average wait time of the processes. Time Table Prosess ID Esit Tinse Tura Around Time Waiting Time Average furn around time = Average waiting time = 2. Consider the arrival time and burst time of five jobs specified in the table below. a. Apply the Shortest Job First (S.JF) operating system algorithm. b. Generate a table to identify the process id, exit time, turn around time, and waiting time. c. Generate a Gantt chart to show how/when each process is executed. a Calculate the average turn around time of the processes. e. Calculate the average wait time of the processes. Time Table Precest ID Ekit Time Turn Areuad Time Waitine Time 1 2 3 4 5 6 Gantt Chart Precess 10 Average turn around time = Average waiting time = 3. Consider the arrival time and burst time of five jobs specified in the table below. a. Apply the Shortest Remaining Time to Finish (SRTF) operating system algorithm. b. Generate a Gantt chart to show how/when cach process is executed. c. Calculate the average wait time of the processes. Average turn around time = Average waiting time = 4. Compare and analyze the results from the three scheduling algorithms. Scheduling algorithm Average turn around time Average wait time FCFS SJF SRTF 5. Based on average turn around time and average wait time, which OS process scheduling algorithm performed the best