First-come, first-served (FCFS)

Shortest job next (SJN)

Shortest remaining time (SRT)

Write a program in Java

19. Write a program that will simulate FCFS, SJN, SRT, and round robin sched- uling algorithms. For each algorithm, the program should compute waiting time and turnaround time for every job, as well as the average waiting time and average turnaround time. The average values should be consolidated in a table for easy comparison. You may use the following data to test your pro gram. The time quantum for the round robin is 4 ms. (Assume that the contex switching time is 0). Arrival Times CPU Cycle (in ms) A016 5 alcul al well- 10 12 20. Modify your program from the previous exercise to generate a random job stream, and change the context switching time to 0.4 ms. Compare outputs from both runs and discuss which would be the better policy. Describe any drastic changes encountered, or any lack of changes, and explain why