how to solve?

The following table shows a Rate Monotonic Scheduling (RMS) scenario with two tasks (Jobl \& Job2). Assuming Jobl has a shorter period and it is assigned a higher priority such that once it starts it will not be preempted until it completes. Draw the static schedule for the scenario shown in Table 4. Write a C code fragment for the non-preemptive cyclic scheduling implementation in above