Consider the following process arrival, CPU and I$/$O burst times, and priorities given in the table below. Consider $1$ as the highest priority.

Assume that only one I$/$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 $=3ms$ with context switch $=1ms.$

$\backslash$table$[[$PID$,$Arrival Time,$\backslash$table$[[$CPU$],[$burst time$]],\backslash$table$[[$I$/$O$],[$burst time$]],\backslash$table$[[$CPU$],[$burst time$]],$Priority$],[$A$,3,7,$cdots,$--,2],[$B$,16,2,--,--,1],[$C$,10,4,3,4,1],[$D$,0,5,8,2,2]]$

Draw CPU and I$/$O Gantt Ghart, and then find Average waiting time, and average response time. Show your calculations in details.