Consider the following task set shown in Table $3($larger number means higher priority$)$:

Task Priority T$14$ T$22$ T$31$ T$43$ T$55$

Table $3$: Example task set for Question $5$

Assuming there are three resources: A$,$ B and C$.$ The time required to access each resource is:

$$ A $=2$ ms $$ B $=3$ ms $$ C$=1$ms

The tasks access the resources according to the following:

$$ Task T$1$ accesses A and B once each on each release.

$$ Task T$2$ accesses B once each on each release.

$$ Task T$3$ accesses B and C once each on each release.

$$ Task T$4$ accesses A and B once each on each release.

$$ Task T$5$ accesses A$,$ B and C once each on each release.

You may assume that there are no nested resource accesses $($that is$,$ each task can only access one resource at a time$).$ A single$-$core system is assumed.

$($i$)[10$ marks$]$ Assuming simple priority inheritance, determine the maximum blocking time of each task. Explain how you calculated them.

$($ii$)[10$ marks$]$ Assuming immediate priority ceiling inheritance, determine the maximum blocking time of each task. Explain how you calculated them.