Need help with this, and if its possible, please give some explanation about how to solve it.

Consider a set of four processes, p1, p2, p3 and p4. Their arrival times and CPU burst lengths are given in the table below. For simplicity assume each process has only a single CPU burst and no 1/0 burst; also assume that the operating system knows the exact CPU burst lengths of all processes. Arrival Time CPU Burst Length 0 11 Process p1 p2 p3 p4 1 6 4 20 3 10 Please schedule the four processes for CPU execution using (1) FCFS, (2) non-preemptive SJF, (3) preemptive SJF, and (4) RR with a time quantum of 5. For each scheduling algorithm, please show the Gantt chart and the calculation for the average waiting time