Round$-$robin scheduling algorithm is one of the simplest scheduling algorithms, where each

process gets a small unit of CPU time $($time quantum$).$ Write a program that implements this

scheduling. Find the scheduling order, average waiting time for the processes and turn$-$around time

$($to each process$)$ when round$-$robin scheduling is applied.

Your program will accept as input following items:

Number of processes, n

Quantum Time Unit

Id and Burst Time for each of n processes

You will create a structure as follows $($This is just a hint, you may choose to do it in any way you

like$)$:

struct process$\{$

int pid; $//$Process ID

int burst$\_$time; $//$CPU Burst Time

int working$\_$time; $//$Time this process executed, if working$\_$time$==$burst$\_$time, process is complete

int t$\_$round; $//$turn around time, time needed for the process to complete

$\}$