Consider three tasks $P, Q$ and $S . P$ has a period of $100 \mathrm{~ms}$ in which it requires $30 \mathrm{~ms}$ of tasking. The corresponding values for $Q$ and $S$ are $(5,1)$ and $(25,5)$ respectively. Assume that $P$ is the most important task in the system, followed by $S$ and then $Q$.
(1) What is the behaviour of the scheduler if priority is based on importance?
(2) What is the processor utilization of $P, Q$ and $S$ ?
(3) How should the tasks be scheduled so that all deadlines are met?
(4) Illustrate one of the schemes that allows these tasks to be scheduled.