Consider the following set of processes:

Process $($Arrival Time$)($Burst Time$)($Comes back after$)($Priority$)$

P$101023$

P$21842$

P$331463$

P$44781$

P$56530$

P$67461$

P$78692$

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.

$1-$ First Come First Served.

$2-$ Shortest Job First.

$3-$ Shortest Remaining Time First.

$4-$ Round Robin, with q $=5$

$5-$ Preemptive Priority Scheduling, with aging; where priority is decremented by

$1$ if the process remains in the ready queue for $5$ time units.

$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, use c$.$

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.