A java code

Deadline 23 November The program implements the following CPU scheduling algorithms. (1) First-Come-First-Serve (FCFS) (2) Shortest-Job-First (SJF) (3) Round-Robin with time slice = 3 (RR-3) (4) Round-Robin with time slice = 5 (RR-5) When a process is created, a Process Control Block (PCB) is expected to be created with the following information: - Process ID: Contains the process ID. - Process state: Contains the state of the Process (New, Ready, Running, Waiting, Terminated) - Burst Time (in ms) - Memory Required in MB The program will read process information from a file ([login to view URL]) - this file will be provided by the instructor. File reading should be performed in an independent thread that creates the PCBs and put them in the job queue. Loading the jobs to ready queue should be performed in an independent thread that continuously checks the available space in memory to load the next job from the job queue to the ready queue. You must make sure that jobs can be loaded to ready queue only if enough space for the job is available in memory. The main thread will perform the scheduling algorithms. Your program should let the user to choose the scheduling algorithm to be applied. A sample input file of four jobs is given as follows (Process ID, burst time in ms, memory required in MB): [Begin of [login to view URL]] Job1 5, 8, 800 Job2 3, 10, 2000 Job3 8, 3, 4000 Job4 6, 7, 1000 [End of [login to view URL]] Note: You can assume that (1) There are no more than 30 jobs in the input file ([login to view URL]) (2) Processes arrive in the order they are read from the file for FCFS, RR-2 and RR-5. (3) All jobs arrive at time 0 for FCFS and SJF. (4) Main memory is limited to 8192 MB