Q$5.$ Consider the following processes P$1,$ P$2,$ P$3,$ P$4,$ P$5$ with CPU burst time and arrival time given in milliseconds. Using Round Robin Scheduling Algorithm $($Quantum Time $=2ms),$ draw a Gantt Chart and calculate the following.

$\backslash$table$[[$Process$,$Arrival Time,Burst Time$],[$P$1,0,10],[$P$2,2,6],[$P$3,5,4],[$P$4,7,5],[$P$5,12,8]$