3c) Blocking Consider four periodic tasks T1, T2, T3, T4 (having decreasing priority), which share four resources R:{A, B, C, D}, accessed using the Priority Inheritance Protocol (PIP). Compute the maximum blocking time Bk for each task, knowing that the longest duration Dk, for a task Tk on resource R is given in the following table (there are no nested critical sections): E B 5 C 9 0 Dk. Ti T T3 T4 A 12 10 0 0 7 D 8 0 7 0 3 0 6 13 5 10 0 8 i. _/4 Compute the maximum blocking time Bk for each task, knowing that the longest duration Dk, for a task Tk on every resource R ii. _/1 How many times can the highest priority task, T, be blocked by each of the resources {A, B, C, D}? Is the blocking bounded