Q$1)$ Consider the following process arrival, CPU, and I$/$O burst time in msec. Assume that only one I$/$O device is available and it operates in a Shortest Job First $($SJF$)$ manner. Ignore the switching time for the I$/$O device. Draw the Gantt charts for the CPU and I$/$O devices and compute the waiting times, turnaround times, and CPU utilization if the CPU is scheduled using a Round Robin algorithm with the time quantum $5$ msec and context switch time $2$msec.

$\backslash$table$[[$Process$,$Arrival time,CPU burst time $($ms$),$I$/$O time $($ms$),$CPU burst time $($ms$)],[$A$,0,8,10,5],[$B$,3,12,7,10],[$C$,6,10,8,8],[$D$,10,5,10,6]]$

A complete and step$-$by$-$step explanation of the solution is required!