Write a program (preferably in c++ or java as they are the easiest for me to understand, but any similar language is fine) that will simulate FCFS, SJN, SRT, and round robin scheduling algorithms. For each algorithm, the program should compute and out put turnaround time and wating time of every job as well as the average waiting time and average turnaround time. The time quantum for round robin is 4 ms. (assume that the context switching time is 0). Input should be read from a file (who's name will be input from the user) with the following format as this example:

5

1 3 10

2 4 15

3 6 8

4 7 3

5 9 12

The first line in this file represents the number of processes.

Each line of the next lines represents one process. Each process is represented by three values: Job ID, Arrival time, CPU Cycle time