3 3. Consider the arrival time and burst time of five jobs specified in the table below. a. Apply the shortest Job Time (SJF) operating system algorithm. b. Generate a table to identify the process id, exit time, tun 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. Calculate the average wait time of the processes, e. Process ID 2 3 Arrival Time 5 2 6 0 Burst Time 6 3 8 4 1 4 5 3 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