The following questions are about the Shortest Job First algorithm and a Priority Queue algorithm for the processes given below (assume all processes arrive at the same time). FCFS Position CPU burst time (ms) Priority ProcesS A 1 Process B 2 Process C3 ProcesS D 4 60 35 15 20 2 (low) 2 (low) 1 (high) 1 (high i. Illustrate times when processes start and finish running respectively (you can use Gantt charts similar to the ones used in the lecture slides to illustrate this or a table). List the times for each context switch in your illustration. You can assume that the time slice is 15 milliseconds (if you were to need this). ii. Calculate the average response time for the priority queue algorithm ii. Calculate the average turnaround time for the priority queue algorithm