Task $3$: SJF with Preemption

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

$2.$ Use the sample processes from Task $1$

$\{1,6,2,0,0\},$

$\{2,8,5,0,0\},$

$\{3,7,1,0,0\},$

$\{4,3,0,0,0\}$

and calculate the waiting time and turnaround time for each process.