4. Consider the arrival time and burst time of three jobs specified in the table below. a. Apply the Priority Non-preemptive operating system scheduling algorithm. b. Given Priority, the lower the value, the higher the priority. c. Generate a table to identify the process id, exit time, turn around time, and waiting time. d. Generate a Gantt chart to show how/when each process is executed. e. Calculate the average turn around time of the processes. f. Calculate the average wait time of the processes. Priority 6 Process ID 1 2 3 4 5 Arrival Time 3 1 4 0 9 Burst Time 1 4 6 2 3 4 7 3 2 4 8 1 5 7 2 6 7 8 5 7 9 Exit Time Turn Around Time Waiting Time Time Table Process ID 4 5 3 8 6 1 7 2 Gantt Chart Process ID Time 0 # # # # # # # # Average Turn Around Time = Average Waiting Time =