A single processor system has to execute six jobs L, M, N, O, P and Q having priorities 4, 7(high), 6, 6, 1(low) and 3 with arrival time(AT) at 5, 4, 3, 1, 2 and 6 units respectively. Their burst...

Urgent solve it please

Extracted text: A single processor system has to execute six jobs L, M, N, O, P and Q having priorities 4, 7(high), 6, 6, 1(low) and 3 with arrival time(AT) at 5, 4, 3, 1, 2 and 6 units respectively. Their burst time(BT) requirements are 5, 6, 7, 9, 2 and 3 units respectively. If two process comes at same time in a queue then order is followed i.e, L has the highest priority and P has the lowest priority. Let the average waiting time by using Round Robin scheduling with time slice of 3-time unit is "x" unit and using Priority based (Non pre- emptive) scheduling is "y" unit. Then find the value of y - x. (Answer up to 2 decimal place)?