Uniprocessor Scheduling

Write a program to simulate RR (q=1), SPN, and SRT. Run at 1,000 simulations. Each simulation needs to include 20 processes which require a randomly determined amount of execution time in the range of [1,10]. The each job becomes available at the time of twice its index (i.e., job 0 is available at time 0, job 17 is available at time 34).

Include Turnaround times and Relative Turnaround times for each algorithm based on average performance.