solve in python, make sure that every process has Arrival time and Burst time

1.Shortest Remaining Time First.

2.Round Robin, with q = 3

3- Preemptive Priority Scheduling, with aging; where priority is decremented by 1 if the process remains in the ready queue for 4 time units.

4- Non-preemptive Priority Scheduling, with aging; where priority is decremented by 1 if the process remains in the ready queue for 4 time units.