Consider the following process arrival, CPU and $\frac{\text{I}}{O}$ burst times, and priorities given in the table below. Consider $1$ as the highest priority.

Assume that only one $\frac{1}{O}$ device is available and it operates in FCFS manner without context switch time.

Assume that there is only one CPU and it is scheduled using preemptive Round Robin with quantum $=2ms$ with context switch $=1ms.$

$\backslash$table$[[$PID$,$Arrival Time,$\backslash$table$[[$CPU$],[$burst time$]],\backslash$table$[[\frac{1}{0}$