Implement a basic CPU scheduling simulator that compares the performance of

scheduling algorithms:

a$.$ First$-$Come, First$-$Served $($FCFS$)$b$.$ Shortest Job First $($SJF$)$

c$.$ Round Robin $($RR$)$ with configurable time quantum

d$.$ Priority Scheduling

Task Requirements:

Implement the simulator in a programming language of your choice $($e$.$g$.,$ C$++,$ Java, or

Python$).$ The simulator should accept input for a set of processes, including Process ID$,$

Arrival time, CPU burst time. Generate the performance metrics for each algorithm,

Average turnaround time, Average waiting time, Analyze the performance of each

algorithm using a single mixed workload scenario $($mix of short and long CPU bursts,

different priorities, and different arrival times$).$

Algorithm Avg. Turn

Around Time

Avg. Wait

Time

Avg. Response

Time

FCFS

SJF

RR

Priority

Write a brief report that includes, Overview of your implementation, Comparison

of the performance metrics for all algorithm, Discussion of when each algorithm might be

preferable with your implementation code