Q$2.$

Consider four periodic tasks ${}_1,{}_2,{}_3$ and ${}_4($having decreasing priority$),$ which share five resources,

$A,B,C,D,$ and $E.$ Compute the maximum blocking time $B_i$ for each task for the following

two protocols, knowing that the longest duration $D_i(R)$ for a task ${}_i$ on resource $R$ is given in the

following table $($there are no nested critical sections$).$

What is the maximum blocking time B$($i$)$ for each task for the following two protocols, Priority Inheritance Protocol $,$ and

Priority Ceiling Protocol?