Assume you have three periodic tasks whose attributes are shown below. Generate a feasible schedule using a cyclic scheduler. Show both the offine schedule on a timeline and the corresponding lookup table 12 T2 5 16 Ts 6 32 Consider the following task set T2 26 TS518 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. Assume you have three periodic tasks whose attributes are shown below. Generate a feasible schedule using a cyclic scheduler. Show both the offine schedule on a timeline and the corresponding lookup table 12 T2 5 16 Ts 6 32 Consider the following task set T2 26 TS518 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