Round Robin is a preemptive process scheduling algorithm that isn't based on the job characteristics but on a predetermined slice of time that's given to each job. This time slice is called a time quantum and its size is crucial to the performance of the system. It usually varies from $100$ milliseconds to $1$ or $2$ seconds. Jobs are placed in the READY queue using a first$-$come, first$-$served scheme and the Process Scheduler selects the first job from the front of the queue, sets the timer to the time quantum, and allocates the CPU to this job. If processing isn't finished when time expires, the job is preempted and put at the end of the READY queue and its information is saved in its PCB$.$ In the event that the job's CPU cycle is shorter than the time quantum, $(1)$ If this is the job's last CPU cycle and the job is finished, then all resources allocated to it are released and the completed job is returned to the user. Your task is to create a C$++$ function that performs the round robin algorithm scheduling based on the sample program as a template.

$\backslash$table$[[\backslash$table$[[$doRR$],[$CPU$],[6],[1],[2],[3],[4],[5],[6],[7],[8],[9],[10],[11],[12],[13],[14],[15]],,\backslash$table$[[$PROCES$],[$P$1],[$P$1],[$P$2],[$P$2],[$P$3],[$P$4],[$P$1],[$P$2],[$P$4],[$P$1],[$P$2],[$P$4],[$P$1],[$P$4],[$P$1],[$P$1]],],[$P$1$:$,>Tc=16,>T_n=9,>Tp=16$