Please answer this, and show me how it was done. Thanks

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. Process ID 1 2 3 4 5 6 Arrival Time 3 1 4 0 2 5 7 9 Burst Time 1 4 6 2 3 4 7 3 Priority 6 9 4 8 1 5 7 2 7 8 Time Table Process ID 4 Exit Time Turn Around Time Waiting Time 5 3 8 6 1 7 2 Gantt Chart Process ID Time 0 # # # # # # # # Average Turn Around Time = Average Waiting Time = 3. Consider the arrival time and burst time of seven jobs specified in the table below. a. Apply the Priority 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, turnaround time, and waiting time. d. Generate a Gantt chart to show how/when each process is executed. Calculate the average turnaround time of the processes. f. Calculate the average wait time of the processes. e. Process ID 1 2 3 4 5 6 7 Arrival Time 3 1 4 0 2 9 12 Burst Time 2 5 6 8 7 Priority 5 8 2 7 1 6 4 6 1 Time Table Process ID Exit Time Turn Around Time Waiting Time Gantt Chart Process ID Time 0 Average Turn Around Time = Average Waiting Time =