please $!!($picture included$)$

Q$1)(4$ marks$)$

In a simple priority$-$driven pre$-$emptive scheduler, three periodic tasks T$1,$ T$2$ and T$3$ and two background $($BG$)$ tasks T$4$ and T$5$ are scheduled. The periodic task T$1$ has the highest priority, executes once every $20ms,$ and requires $5ms$ of execution time. The periodic task T$2$ requires $5ms$ of execution time every $50ms.$ The periodic task T$3$ requires $5ms$ of execution time every $100ms.$ The BG T$4,$ and T$5$ each requires $100ms$ of execution time. Assume all tasks start at time $0ms.$

$(1)$ Determine the time $T4$ and $T5$ will complete.

$(2)$ Draw the chart.

$0,5$

Q$2)(3\mathrm{.}5$ marks$)$

Table below shows the mapping between process requests $(POP3)$ and resource allocation $(A,B,$ and $C$ resources$).$ A has $5$ instances, $B$ has $1,$ and $C$ has $5$ instances.

$\backslash$table$[[,$Allocation,Request,Available$],[,$A$,$B$,$C$,$A$,$B$,$C$,$A$,$B$,$C$],[$P$0,0,1,0,0,0,0,0,0,0],[$P$1,2,0,0,2,0,2,,,],[$P$2,3,0,3,0,1,0,,,],[$P$3,0,0,2,0,0,2,,,]]$

$(1)$ Is there a sequence for processes that will allow deadlock to be avoided? If yes, what is it$?$

$(2)$ If $P2$ increases its request for $C$ resources by $2$ more, what will the sequence be$,$ if any?