V$.$ Three periodic processes with the following characteristics are to be scheduled:

$($D is the period and $T$ is the total CPU time$)$

a$)$ Determine if a feasible schedule exists for RM and EDF.

b$)$ Draw a timing diagram for the first $40$ time units. For each of the $3$ cases, show the schedules

produced by RM and by EDF and point out if any task would miss its deadline.