In a multiprogramming computing environment, process quantum is set to be $10ms.$ Given the following processes and their properties, answer the question $2-$x$0$x$.$ Assume none of the processes are blocked until their termination and preemptive scheduling is action.

Each cell on the tables in the questions represents a process$-$quanturn $(10ms)$ and time$-$order of the quantum $($cells$)$ are from left to right.

If you need additional quantum $($cells$)$ you can add as a second row.

$\backslash$table$[[\backslash$table$[[\backslash$table$[[$Process$],[$Name$]]],[$P$1]],\backslash$table$[[$Arrival time$],[($time$-$loaded$)[$ms$]]],\backslash$table$[[($Expected$)],[$run$-$time length $[$ms$]]],$Priority$],[P_2,0,46As75,2],[P3,\frac{13}{25},2010,1-$