A system contains five tasks. There are three resources X, Y, and Z. The resource requirements of the tasks are specified as follows: T: [X; 1] [Y; 2]. T: [Z; 4]. T: [X; 2]. 3: T: [X, 2][Y; 3]. 4: Ts: [X; 1] [Z; 3]. The tasks are indexed in the decreasing order of priorities and scheduled with the priority ceiling protocol. Find the maximum blocking time for each task.