1.(24 Points) Consider two periodic tasks A(4, 2) and B(7, 3.2), to be scheduled on a uniprocessor with non-preemptive EDF algorithm. Assume that the release time for the first job of task A and task B are 1 and 0 respectively. (a) (12 points) Draw a figure to show their schedulability. Mark any missed deadlines until t=20. (b) (12 points) Use the Theorem in [Jaffey et al. 1991] to validate the schedulability of this set. 1.(24 Points) Consider two periodic tasks A(4, 2) and B(7, 3.2), to be scheduled on a uniprocessor with non-preemptive EDF algorithm. Assume that the release time for the first job of task A and task B are 1 and 0 respectively. (a) (12 points) Draw a figure to show their schedulability. Mark any missed deadlines until t=20. (b) (12 points) Use the Theorem in [Jaffey et al. 1991] to validate the schedulability of this set