Assignment $2$: CPU Scheduling. Compare the performance of the two CPU scheduling algorithms $-$ SJF and RR$.$

Description$/$Concept:

A system snapshot contains $N$ number of processes, each with unique integer ID and varied burst lengths

All the processes are assumed to appear$/$arrive at the same time on the system

Each scheduling algorithm generates an ordering according to which the processes would be executed

The scheduling algorithms calculate the ATT $($average turnaround time$)$

Assignment

Write a program $($in Java, $C,$ or Python$)$ simulating a simple CPU scheduler to evaluate, based on average turnaround time $($ATT$),$ the two CPU scheduling algorithms $-$ Shortest Job First $($SJF$)$ and Round$-$robin $($RR$).$ Note: this program must not be an interactive program. That is$,$ the program does not require any input from the user.

Write a generator for crating the snapshot of the system with $5$ processes where each process has the following attributes:

i$)$ an identifier $($a unique random integer value between $0$ and $9)$

Note: the ID is unique; no two processes have the same ID value and must be within the specified range $[0-9]$

ii$)$ a burst length $($a random integer value between $20-99)$