a$)$ The Unix scheduler works according to the algorithm:

$P(i)=P_{\text{b}\text{a}\text{s}\text{e}}+\frac{T_{\text{C}\text{P}\text{U}}(i)}{2}+P_{\text{n}\text{i}\text{c}\text{e}}$;$,T_{\text{C}\text{P}\text{U}}(i)=\frac{T_{\text{C}\text{P}\text{U}}(i-1)}{2}$

Given are three processes with the initial priorities $P1=60,P2=70$ and $P3=50.$ The timer cycle is $f=100Hz,$ the recalculation of priorities is done every second. Complete the table below:

$\backslash$table$[[$Time$,$Process $1P_1=60,$Process $1P_2=70,$Process $1P_3=50$