Question 5 (18 marks) Consider six tasks 71, ..., 76 with release times, execution times, and deadlines presented below. 71 T2 73 TA T5 T6 release time, r; 0 2 5 4 2 execution time, e; 3 2 2 3 3 deadline, di 8 8 13 10 5 14 We say task 7; precedes task 7; if the predecessor must complete the execution of 7; before 7, can execute. The precedence relationships between tasks 71, ...,76 are as the following 71 precedes 73; . 71 precedes 74; 72 precedes 74; 72 precedes 75; 73 precedes 76; . T4 precedes 76; 75 precedes T4. (a) [4 marks] Draw the directed acyclic graph representing the precedence of the tasks where a directed edge marks a precedence. (b) [4 marks] Does a scheduling approach based on Latest Deadline First (LDF) yield a feasible deadline? Explain why if the answer is no, and construct the schedule if the answer is yes. (c) [10 marks] Does Earliest Deadline First with Precedence (EDF*) yield a feasible schedule? Explain why if the answer is no, and construct the schedule if the answer is yes