Task $4$: LJF with Preemption $($CLO $2,3)$

$1.$ Modify your LJF code to implement the LJF with Preemption scheduling algorithm.

$2.$ Use the sample processes from Task $1$ and calculate the waiting time and turnaround time for each process.