Write a program that will simulate non - preemptive process scheduling algorithms in C++:

FCFS(First Come First Serve).

SJN(Shortest Job Next)

Priority

Your program should input the information necessary for the calculation of average turnaround time including:

Time required for a job execution;

Arrival time;

Priority

Note: The information can vary for different algorithms.

The output of the program should include: starting and terminating time for each job, turnaround time for each job, average turnaround time.