Consider the following two periodic processes: T$1=(1,6,6)$ and T$2=(3,4,4).$ Suppose that

they have fixed scheduling priorities $\backslash$pi $1$ and $\backslash$pi $2,$ respectively. Further, assume non$-$preemptive

scheduling over $12$ time units.

a$)$ Is there a feasible schedule when $\backslash$pi $1>\backslash$pi $2?$ Justify.

b$)$ Repeat with $\backslash$pi $1<\backslash$pi $2.$ Justify.

c$)$ Check the inequalities $\backslash$tau $2/\backslash$tau $1$ c$1+$ c$2<=\backslash$tau $2$ and c$1+$ c$2<=\backslash$tau $1.$ Are both satisfied?