show all work

5. 127pts.l Given the following set o length of the CPU burst in ms: ven the following set of processes, with arrival times, priorities, and the Process Arrival Time Burst time 3 4 10 Priority P1 P2 P3 P4 0 3 2 Note: a lower number means higher priority: processes P2 P4 arrive at the same time, in the given order) Draw a Gantt chart showing a FCFS scheduling algorithm. a. b. Draw a Gantt chart showing a non-preemptive Priority scheduling algorithm c. Draw a Gantt chart showing a Round Robin Scheduling algorithm with quantum of 4ms d. Compute the average wait time for the FCFS algorithm. e. Compute the average wait time for the Round Robin Scheduling algorithm