C language show all work

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