A Polling server with CS$=2,$ TS$=5$ as capacity and period is used for scheduling of the following tasks

Periodic tasks

Ci Ti

Task$114$

task$226$

Aperiodic tasks

ai Ci

J$122$

J$251$

J$3102$

a$)(2$ pts$)$ Determine whether this task set is feasible?

b$)(5$ pts$)$ Verify your answer by constructing the schedule for the task set on paper.

c$)(2$ pts$)$ Compute whether the task set is feasible according to LL $($Liu & Layland$)$ and HB $($Bini$)$

d$)(5$ pts$)$Verify your answer by constructing the schedule for the task set on paper.