Scheduling algorithms

Consider the following set of processes with the length of the CPU burst time given in milliseconds with time quantum of 2ms. Complete the following i) Draw the Gantt chart illustrating the process execution for all scheduling algorithms ii) Find turn around time iii) Find waiting time iv) Which algorithm results in minimum average waiting time? Process Burst time Priority P1 10 3 P2 1 3 P3 1 1 P4 1 4 P5 5 2