Write a Java program to implement a shortest job first scheduling algorithm

with round robin. Your program should first prompt the user to input a list of

process ID$,$ arrival time, and burst time $($in msec$)$ for each process to be run

on the CPU. The list is terminated by $000$ for the process ID$,$ arrival time, and burst time. The program output should draw a Gantt chart

$($as text, e$.$g$.,0-$p$1-3-$p$3-5-$p$5-9-......)$ that shows the scheduling order of the processes using SJF with RR scheduling algorithms. Also print the turnaround, response, and waiting time for each process along with their

average for all processes. Make sure to display helpful messages to

the user for input and output.