Consider the following set of processes:Once each process is done processing its $$Burst Time$,$ it goes to the waiting queue, then $$Comes back$$ to the ready queue after the time shown.You are required to simulate the CPU schedule for a period of $200$ time units. For each of the following scheduling algorithms, your program must show the Gantt chart, average waiting time, and average turnaround time$\mathrm{.}1-$ First Come First Served$\mathrm{.}2-$ Shortest Job First$\mathrm{.}3-$ Shortest Remaining Time First$\mathrm{.}4-$ Round Robin, with q $=55-$ Preemptive Priority Scheduling, with aging; where priority is decremented by $1$ if the process remains in the ready queue for $5$ time units$\mathrm{.}6-$ Non$-$preemptive Priority Scheduling, with aging; where priority is decremented by $1$ if the process remains in the ready queue for $5$ time units.For this assignment, you may use any programming language of your choosing.Process Arrival Time Burst Time Comes back afterPriorityP$101023$P$21842$P$331463$P$44781$P$56530$P$57461$P$78692$Hint: You should create a process that initially creates the $7$ processes, and continuously updates the status of the processes, and another process that schedules those processes, and plots the results.Figure $0\mathrm{.}1$: One

hortest remaining tine CHART:

Average rasting tinet $=137,429$

Average waiting time $=126\mathrm{.}143$ Average turnaround time $=168\mathrm{.}429$