Goal: Gantt Chart Process Schuduling Program Implemented in JAVA. Input: A table of processes with their Names, Arrival Times, and Burst Times. Output: Gantt Charts for each of the following algorithms: FCFS, SJF (pre-emptive), and RR with q=2. Description: Create a scheduling simulation that will output Gantt Charts for the algorithms above. You will read the input file, then generate Processes that each algorithm will then organize for you. Your output should be in the format of a simple Gantt Chart. Use 1 or 2 characters to represent each time unit. You can print the _, -, |, and other similar characters to draw your chart. Consider what happens during a period of time where no process is running. For your chart, leave a or a / in that time units position.

Sample output (These use 2 spaces for 1 time unit):

9 5 B 8 9 7 8 FCFS ID AT BT WT TT B 8 9 7 16 A 9 5 15 20 RR, q=4 A B 0----7--11--15---1923--24--28--29 ID AT BT WT TT C 7 8 8 16 B 8 9 12 21 A 9 5 10 15 9 5 B 8 9 7 8 FCFS ID AT BT WT TT B 8 9 7 16 A 9 5 15 20 RR, q=4 A B 0----7--11--15---1923--24--28--29 ID AT BT WT TT C 7 8 8 16 B 8 9 12 21 A 9 5 10 15