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, cxit 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 turn around time of the processes. e. Calculate the average wait time of the processes. Process ID 1 2 3 Arrival Time Burst Time 3 6 0 10 7 5 5 7 1 2 5 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