For this assignment, you may ignore the time overhead associated with context switching. In addition, deadlines are equal to periods unless stated otherwise. To receive full credit, you need to address all the questions/requests made in italic. If a job misses its deadline, it should be dropped at that time. 1. Assume you have three periodic tasks whose attributes are shown below. Task CT 71 72 3 10 3 15 b) Generate a feasible schedule using a cyclic scheduler. Show both the offline schedule on a timeline and the corresponding lookup table. Using a timeline, show how a cyclic executive can be constructed for the task set. You may assume that the tasks can be arbitrarily split up", but only at integer execution-time points. Thus, each split part of a task will have an integer execution time. For this assignment, you may ignore the time overhead associated with context switching. In addition, deadlines are equal to periods unless stated otherwise. To receive full credit, you need to address all the questions/requests made in italic. If a job misses its deadline, it should be dropped at that time. 1. Assume you have three periodic tasks whose attributes are shown below. Task CT 71 72 3 10 3 15 b) Generate a feasible schedule using a cyclic scheduler. Show both the offline schedule on a timeline and the corresponding lookup table. Using a timeline, show how a cyclic executive can be constructed for the task set. You may assume that the tasks can be arbitrarily split up", but only at integer execution-time points. Thus, each split part of a task will have an integer execution time