Task $2$: Longest Job First $($LJF$)$

$($CLO$2,3)$

Write a program in C$/$C$++$ to implement the Longest Job First $($LF$)$ scheduling algorithm.

Use the same set of sample processes from Task $1$ and calculate the waiting time and turnaround time for each process. $($On Paper $-$ Handwritten$)$