need urgent help please

English Consider the following set of processes, which are scheduled with a temporal quantum of 10 units. Represent using a Gantt diagram the execution of these processes using the First Come First Served (FFS) and Priority Scheduling (PS) algorithms, in order to compute the termination time of each process, and the average waiting time. Compare the two schedulings, and report only the best one in terms of average waiting time. Please, write your answer on a single line, indicating the termination times of P1, P2, P3, P4 and P5 followed by the average waiting time. Separate the numbers with a single space. Report the average waiting time with a single decimal digit. Do not enter any other character in the response. Example of correct answer. 202311456730.5 ID Domanda / Question ID: SCHED