Tasks and Deliverables 1. Complete requested data for each scheduling algorithm. 2. Average turn around time must be fully explained (e.g. 1 + 2 + 3 + 4 + 5 = 15 / 5 = 3) 3. Average wait time must be fully explained (e.g. 1 + 2 + 3 + 4 + 5 = 15 / 5 = 3)

2. Consider the arrival time and burst time of five jobs specified in the table below. a. Apply the Shortest Job First (SJF) 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