Write a c program to implement the fcfs algorithm

VERY IMPORTANT NOTES! READ DATA FROM INPUT. TXT DO NOT ASK FOR NUMBER OF PROCESSES OR BURST TIME

USE LINKED LIST In the input.txt first column is the burst time 2nd column is the arrival time 3rd one is the priority

APPENDIX File Input.txt 5:0:3 4:1:2 3:1:1 4:2:2 3:3:1 output.txt/Screen output Scheduling Method: First Come First Served Process Waiting Times: P1:0 ms P2: 4 ms P3: 8 ms P4: 10 ms P5: 13 ms Average Waiting Time: 7 ms APPENDIX File Input.txt 5:0:3 4:1:2 3:1:1 4:2:2 3:3:1 output.txt/Screen output Scheduling Method: First Come First Served Process Waiting Times: P1: 0 ms P2: 4 ms P3: 8 ms P4: 10 ms P5: 13 ms Average Waiting Time: 7 ms