3. 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, waiting time, and response 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. g. Calculate the average response time of the processes