Tasks and Deliverables 1. Complete requested data for each scheduling algorithm. 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 and the associated time. d. Calculate the average tum around time of the processes. e. Calculate the average wait time of the processes. Process ID Arrival Time Burst Time 1 3 6 2 0 10 5 5 7 5 2 7 3 4 1 Time Table Process ID Exit Time Turn Around Time Waiting Time 1 2 3 4 5 Gantt Chart Process ID Time 0 Average Turn Around Time = Average Waiting Time