Using a Multilevel Queue Scheduling algorithm in Fig$\mathrm{.}1.$ Consider the following processes with the relative CPU bursts.

$\backslash$table$[[$Process$,$Arrival Time,Burst Time$],[P_1,0,20],[P_2,1,60],[P_3,2,5],[P_4,2,40]]$

Fig. $1$

Multilevel Queue Fixed priority non$-$preemptive