The table below describes the CPU$-$I$/$O Burst cycles for processes P$1,$ P$2$ and P$3.$ Assume $0$ is the highest priority.

$($a$)$ Draw the Gantt chart timeline, illustrating the interleaving of processes, and calculate the average waiting time for each process under

$1.$a non pre$-$emptive priority scheduling algorithm

$2.$a round robin scheduling algorithm with quantum $=6.$