Implement the SJF scheduling algorithm and calculate the average waiting time and turnaround time for a set of processes by:

Defining a Process Structure: Create a structure to store the necessary information for each process, such as process ID$,$ duration, waiting time, and turnaround time.

Gathering Input: Prompt the user to enter the number of processes.

For each process, ask the user to input the process ID and its duration.

SJF Implementation: Sort the list of processes based on their duration in ascending order.

Calculate the waiting time and turnaround time for each process. To calculate the waiting time of a process, you can use the formula: waiting$\_$time$[$i$]=$ waiting$\_$time$[$i$-1]+$ duration$[$i$-1].$

To calculate the turnaround time of a process, you can use the formula: turnaround$\_$time$[$i$]=$ waiting$\_$time$[$i$]+$ duration$[$i$].$

Calculating Averages: Compute the average waiting time and average turnaround time.

Displaying the Results: Present the calculated averages to the user and display the waiting time and turnaround time for each process.

Given the following input:

$4$

$6$

$8$

$5$

$3$

We should receive the following output:

Process Execution Time Waiting Time Turnaround Time

$4303$

$3538$

$16814$

$281422$

Average Waiting Time: $6\mathrm{.}25$

Average Turnaround