Consider three periodic tasks T1, T2, and T3 where ?1 > ?2 > ?3. All three tasks share resources R1, R2, and R3. There are no nested critical sections. The longest duration of a task T_i in accessing resource R_k is given in the following table.

Task	R1	R2	R3
T1	2	0	2
T2	2	3	0
T3	3	2	5

Compute the maximum blocking time B_i for each task assuming that the priority ceiling protocol is used.