$8\mathrm{.}9$ Given the processes A through F in Figure $8\mathrm{.}21($a$)$ where their deadline equals their

period, determine whether they can be scheduled on time using a non$-$preemptive

scheduler. Assume all processes begin at the same time and their execution times are as

follows: A: $8ms,B$:$25ms,C$:$6ms,D$:$25ms,E$:$10ms,F$:$25ms.$ Explain your

answer by showing that each process either meets or misses its deadline.

$($a$)$

$($b$)$

Figure $8\mathrm{.}21$: Priority assignment; $($a$)$ rate monotonic, $($b$)$ deadline monotonic priority assignment.