$11.$ Assuming that the dispatch latency for scheduling one process is $1\mathrm{.}5$ ms $.$ The total dispatch latency for scheduling five processes arriving with the Arrival times $($ms$)\backslash ((0,1,2,3,4)\backslash ),$ respectively, is Using round robin scheduling algorithm with quantum $3,$ given the burst times of the five processes are $(12,8,4,10$ and $5)$ ms$,$ respectively.