Write a C program to simulate Round Robin Scheduling for the below set of processes that have varying arrival times. Their respective burst times are also listed below.

Your program should prompt the user to enter the number of processes, the time quantum$/$slice value, followed by the burst and arrival times for each process.

Your program should then implement Round Robin Scheduling and list out the sequence of the processes running with time stamps $($check sample output$)$

NOTE: As covered during the lecture, remember at time $$t$,$ when a process has just completed and wanted to enter the readyQ and another process has simultaneously arrived, the process that has arrived will first enter the queue.

At the end of your program, the turn around time and waiting times for each process should be listed out along with the average turn around and waiting times.

Test your code using the sample output case to ensure your program$$s robustness.

Sample Output for below case: