Process Scheduling

Using the process scheduling simulator introduced before, achieve the following:

• Shortest Job First algorithm, 10 processes all arriving at the same time and with 50 units running duration, CPU burst time given between 10 and 20 units.
• Pre-emptive Shortest Job First algorithm, at least 25 processes arriving with 5 units delay between each other, 60 units for total running duration and CPU burst is 10 units.
• First-Come, First-Served algorithm, 30 processes all arriving at the same time, variable running duration between 15 and 25 units, 2 units for CPU burst time and I/O burst time varying between 10 and 20 seconds.
• Explain the following Gannt chart: