1. Given the task set and cyclic-executive schedule in Table 1, determine whether the cyclic-executive schedule is feasible. Determine the initial phase for each task such that the execution of each task instance finishes between its arrival and deadline. Period P 60 and frame length f-4 Task Period Deadline Execution Time Frames 15 12 10 2, 5, 9, 12 1, 4, 7, 10, 13 1, 3, 6, 8, 11, 13 2, 3, 5, 6, 8, 9, 11, 12, 14, 15 Table 1: A task set and schedule 1. Given the task set and cyclic-executive schedule in Table 1, determine whether the cyclic-executive schedule is feasible. Determine the initial phase for each task such that the execution of each task instance finishes between its arrival and deadline. Period P 60 and frame length f-4 Task Period Deadline Execution Time Frames 15 12 10 2, 5, 9, 12 1, 4, 7, 10, 13 1, 3, 6, 8, 11, 13 2, 3, 5, 6, 8, 9, 11, 12, 14, 15 Table 1: A task set and schedule