FCFS Process Scheduling

FCFS(First Come First Serve) is a Non-preemptive Algorithm. It works in accordance with the arrival time of the processes where the process with the shortest arrival time gets executed first.
This algorithm is designed by making use of queue data structure.

Make sure you enter the process in increasing order of their arrival time at any point of time.

Tables used from https://github.com/seleznevae/libfort

Program-tested on Linux System

Run commands present in the run.txt file on your terminal