Fill in the Gantt charts, using the given scheduling policy and assuming the following process characteristics in the table below. Also, use the space below to calculate the average turnaround time and average waiting for each algorithm. If there is queuing collision in the ready queue between new processes and extant processes, give priority to the new processes. Consider seven processes A to G with arrival times and CPU burst times as follows:Here “2-ε” indicates that B has arrived just before time unit 2, and similarly for the others. Assume that, when joining the Ready Queue, (new or existing) processes always get appended at the end of the queue.a. Draw a chart that illustrates the execution of these processes using the specified scheduling algorithm. (FCFS, RR(time quantum = 2), SPN (Shortest Process Next, non-preemptive), PSPN (Shortest Process Next, preemptive))b. Calculate the average turnaround time of RR and SPN.