Consider a variation of Round Robin scheduling algorithm in which the time

quantum is associated with some priority concept. Suppose, there are four processes

P$1,$ P$2,$ P$3$ and P$4.$ For security reasons, the process should be executed in the given

order: P$3,$ P$2,$ P$1,$ P$4.$ Write the pseudo$-$code of this approach and demonstrate with

an example how this can be achieved. Also comments on effectiveness$/$weakness

of this approach.