Implement the Shortest Job First $($SJF$)$ scheduling algorithm with dynamically

changing arrival times for processes. As the simulation progresses, simulate

processes arriving at different times and see how SJF handles these dynamic

arrivals.

Evaluation Criteria:

$1.$ Correct implementation of the SJF algorithm with dynamic arrival times.

$2.$ Simulation output demonstrating the scheduling of processes with varying

arrival times.

$3.$ Analysis of the impact of dynamic arrival times on average waiting time

and average turnaround time