In Java, write a program to simulate the First Come First Serve (FCFS) CPU scheduling algorithms:

Ignore the Time_quantum and RR.

The task information will be read from an input file (input.txt) with the following format: Pid Arrival_Time Burst Time Priority All of fields are integer type where Pid is a unique numeric process ID Arrival Time is the time when the task arrives in the unit of milliseconds Burst Time is the CPU time requested by a task, in the unit of milliseconds Priority is the priority associated with each task with low numbers representing high priority. What to do? Create a simple user interface to ask user for input.txt file, a scheduling algorithm and Time quanum if RR is chosen Print progress of task every unit time (millisecond). . Once all tasks are completed, the program should compute and print o Average waiting time o Average response time o Average turnaround time o CPU utilization rate The task information will be read from an input file (input.txt) with the following format: Pid Arrival_Time Burst Time Priority All of fields are integer type where Pid is a unique numeric process ID Arrival Time is the time when the task arrives in the unit of milliseconds Burst Time is the CPU time requested by a task, in the unit of milliseconds Priority is the priority associated with each task with low numbers representing high priority. What to do? Create a simple user interface to ask user for input.txt file, a scheduling algorithm and Time quanum if RR is chosen Print progress of task every unit time (millisecond). . Once all tasks are completed, the program should compute and print o Average waiting time o Average response time o Average turnaround time o CPU utilization rate