Priority Non-preemptive. Need help filling the charts

5. Consider the arrival time and bunt 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, tum around time, and waiting time. d. Gencrate a Gantt chart to show how/when each process is executed. c. Calculate the average turn around time of the processes. f. Calculate the avenge wait time of the processes. g. Calculate the average response time of the processes. Average Turn Around time = Average waiting time = Average response time