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. 4. (26 Points) Show by example (or otherwise) that under an EDF priority assignment, there can exist a point in time t and an integer L during the execution of a schedulable synchronous task set (with relative deadlines equal to periods), such that D[t,t +L]