Task $1$: Shortest Job First $($SJF$)($CLO $2,3)$

$1.$ Write a program in C$/$C$++$ to implement the Shortest Job First $($SJF$)$ scheduling algorithm.

$2.$ Create a set of sample processes with burst times and arrival times. Calculate the waiting time

and turnaround time for each process.