Question E (8 points): 1. Construct an EDF schedule with HVDF scheduling policy for the following tasks. What is the total value obtained? Ti-(cipi): T (6,24); T2- (4, 8); T3- (4, 8); T4- (4, 12). The values of these tasks are 2, 3, 1, and 2 respectively. Note: Schedule tasks based on deadline as the primary criteria for priority assignment (EDF); if there is a tie in priority, then choose the task with HVDF (High Value Density First) basis. 2. Assume that the system has only aperiodic tasks and each task requires exclusive access to a resource "R" for their entire duration of execution. Aperiodic tasks. T-n,ci ,di,vi ): Ti = (0, 4, 12, 4); T2= (1, 2, 5, 2); T3 (3, 3, 6, 3),Ta = (6, 2, 10, 2), where ri,ci ,di , and vi are the ready time, computation time, deadline, and value of the task, respectively. Show the schedules produced by the EDF and Clairvoyant scheduling algorithms. What is the "value ratio" for this example