You are tasked with scheduling three periodic tasks, $A,B,$ and $C,$ on a processor. The following

table shows the period and execution time of each task:

a$.$ What is the minimum period, $p_A,$ that ensures tasks $A,B,$ and $C$ can be scheduled on

the processor using $ED{F}_{?}?$

$($Hint: The minimum period implies full processor utilization$)$

b$.$ Draw the EDF schedule for the value of $p_A$ derived in part $($a$)$

c$.$ What is the minimum period, $p_A,$ that ensures tasks $A,B,$ and $C$ can be scheduled on

the processor using $R{M}_{?}?$

d$.$ Draw the RM schedule for the value of $p_A$ derived in part $($c$)$

e$.$ Consider the task precedence graph below. In the figure, $e_i$ denotes the execution

time of task i$.$ Assume lower numbered tasks have higher priority than higher numbered

tasks. Consider scheduling these tasks on two processors. Draw the schedule for these tasks

and report the makespan.